Block #1,407,252

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2016, 11:37:01 AM · Difficulty 10.8059 · 5,437,677 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
765dfba2bbee8929d9f2c1f502b282198c573c408b30be62d0f9deee5c7501f5

Height

#1,407,252

Difficulty

10.805897

Transactions

2

Size

425 B

Version

2

Bits

0ace4f44

Nonce

24,973,817

Timestamp

1/10/2016, 11:37:01 AM

Confirmations

5,437,677

Merkle Root

715a6ea17dbd650d715bfbbb901224e9c3bedf5b6968400b90813852d36182f6
Transactions (2)
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.

5.863 × 10⁹⁶(97-digit number)
58631646106331041352…55048806819517399039
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
5.863 × 10⁹⁶(97-digit number)
58631646106331041352…55048806819517399039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.172 × 10⁹⁷(98-digit number)
11726329221266208270…10097613639034798079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.345 × 10⁹⁷(98-digit number)
23452658442532416540…20195227278069596159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.690 × 10⁹⁷(98-digit number)
46905316885064833081…40390454556139192319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.381 × 10⁹⁷(98-digit number)
93810633770129666163…80780909112278384639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.876 × 10⁹⁸(99-digit number)
18762126754025933232…61561818224556769279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.752 × 10⁹⁸(99-digit number)
37524253508051866465…23123636449113538559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.504 × 10⁹⁸(99-digit number)
75048507016103732930…46247272898227077119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.500 × 10⁹⁹(100-digit number)
15009701403220746586…92494545796454154239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.001 × 10⁹⁹(100-digit number)
30019402806441493172…84989091592908308479
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:58,003,849 XPM·at block #6,844,928 · 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