Block #2,175,301

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/24/2017, 10:22:28 AM · Difficulty 10.9148 · 4,661,178 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
b9b9d19872bb03e74ad4b5b73a32e2d3a788d00c6737e664a0c458742673ae33

Height

#2,175,301

Difficulty

10.914838

Transactions

3

Size

651 B

Version

2

Bits

0aea32ce

Nonce

498,578,919

Timestamp

6/24/2017, 10:22:28 AM

Confirmations

4,661,178

Merkle Root

d41486fa62790ee613fe42e0e7fec8d10a5cf23eeb9df67b578d610ce4c6baed
Transactions (3)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.231 × 10⁹⁵(96-digit number)
12315624337390030819…89524804611276190879
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
1.231 × 10⁹⁵(96-digit number)
12315624337390030819…89524804611276190879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.463 × 10⁹⁵(96-digit number)
24631248674780061638…79049609222552381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.926 × 10⁹⁵(96-digit number)
49262497349560123276…58099218445104763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.852 × 10⁹⁵(96-digit number)
98524994699120246553…16198436890209527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.970 × 10⁹⁶(97-digit number)
19704998939824049310…32396873780419054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.940 × 10⁹⁶(97-digit number)
39409997879648098621…64793747560838108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.881 × 10⁹⁶(97-digit number)
78819995759296197242…29587495121676216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.576 × 10⁹⁷(98-digit number)
15763999151859239448…59174990243352432639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.152 × 10⁹⁷(98-digit number)
31527998303718478896…18349980486704865279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.305 × 10⁹⁷(98-digit number)
63055996607436957793…36699960973409730559
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,936,107 XPM·at block #6,836,478 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy