Block #1,544,224

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2016, 4:49:40 PM · Difficulty 10.6534 · 5,265,839 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a40323f74fefa67a5a9d102c00cbe73d435255b6aaa7ac0ad1d0ec0e59e89f4

Height

#1,544,224

Difficulty

10.653444

Transactions

22

Size

7.49 KB

Version

2

Bits

0aa74815

Nonce

788,415,993

Timestamp

4/16/2016, 4:49:40 PM

Confirmations

5,265,839

Merkle Root

53a1d552954406086bb1391e956caf88a3052dd66a68f15ef48eeea0df2202d5
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.

3.213 × 10⁹³(94-digit number)
32135150928027129669…44705120202269725481
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
3.213 × 10⁹³(94-digit number)
32135150928027129669…44705120202269725481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.427 × 10⁹³(94-digit number)
64270301856054259338…89410240404539450961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.285 × 10⁹⁴(95-digit number)
12854060371210851867…78820480809078901921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.570 × 10⁹⁴(95-digit number)
25708120742421703735…57640961618157803841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.141 × 10⁹⁴(95-digit number)
51416241484843407470…15281923236315607681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.028 × 10⁹⁵(96-digit number)
10283248296968681494…30563846472631215361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.056 × 10⁹⁵(96-digit number)
20566496593937362988…61127692945262430721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.113 × 10⁹⁵(96-digit number)
41132993187874725976…22255385890524861441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.226 × 10⁹⁵(96-digit number)
82265986375749451953…44510771781049722881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.645 × 10⁹⁶(97-digit number)
16453197275149890390…89021543562099445761
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,724,578 XPM·at block #6,810,062 · 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