Block #2,151,961

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/8/2017, 5:39:37 PM · Difficulty 10.9007 · 4,656,164 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6c05a4c3ae85fb650ab782faa3252d8f79cd3ab9bbf5ad2336cfa858578fc420

Height

#2,151,961

Difficulty

10.900691

Transactions

14

Size

10.60 KB

Version

2

Bits

0ae693a9

Nonce

1,936,849,039

Timestamp

6/8/2017, 5:39:37 PM

Confirmations

4,656,164

Merkle Root

c50c7efbde276bc7421a1f961e8c83b45eeaef4fb8ebf190d477e9b53b65ab14
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.447 × 10⁹⁴(95-digit number)
14477700441828279583…04819767496331757759
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.447 × 10⁹⁴(95-digit number)
14477700441828279583…04819767496331757759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.895 × 10⁹⁴(95-digit number)
28955400883656559166…09639534992663515519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.791 × 10⁹⁴(95-digit number)
57910801767313118332…19279069985327031039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.158 × 10⁹⁵(96-digit number)
11582160353462623666…38558139970654062079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.316 × 10⁹⁵(96-digit number)
23164320706925247332…77116279941308124159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.632 × 10⁹⁵(96-digit number)
46328641413850494665…54232559882616248319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.265 × 10⁹⁵(96-digit number)
92657282827700989331…08465119765232496639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.853 × 10⁹⁶(97-digit number)
18531456565540197866…16930239530464993279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.706 × 10⁹⁶(97-digit number)
37062913131080395732…33860479060929986559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.412 × 10⁹⁶(97-digit number)
74125826262160791465…67720958121859973119
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,709,040 XPM·at block #6,808,124 · 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.

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