Block #913,569

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/28/2015, 6:24:34 PM · Difficulty 10.9277 · 5,895,190 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
52a9d3dfa8257c10092b0a95ed08a5f53fca5a034b697e27665bfcb5e23a1250

Height

#913,569

Difficulty

10.927732

Transactions

9

Size

3.07 KB

Version

2

Bits

0aed7fd4

Nonce

533,706,642

Timestamp

1/28/2015, 6:24:34 PM

Confirmations

5,895,190

Merkle Root

07fd436c9241c5c91e029939cb3073f9254b4375736c6e6d2c4a1ae0d2278a63
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.

4.957 × 10⁹⁵(96-digit number)
49578485088367872536…65395656824768169841
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
4.957 × 10⁹⁵(96-digit number)
49578485088367872536…65395656824768169841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.915 × 10⁹⁵(96-digit number)
99156970176735745073…30791313649536339681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.983 × 10⁹⁶(97-digit number)
19831394035347149014…61582627299072679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.966 × 10⁹⁶(97-digit number)
39662788070694298029…23165254598145358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.932 × 10⁹⁶(97-digit number)
79325576141388596058…46330509196290717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.586 × 10⁹⁷(98-digit number)
15865115228277719211…92661018392581434881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.173 × 10⁹⁷(98-digit number)
31730230456555438423…85322036785162869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.346 × 10⁹⁷(98-digit number)
63460460913110876847…70644073570325739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.269 × 10⁹⁸(99-digit number)
12692092182622175369…41288147140651479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.538 × 10⁹⁸(99-digit number)
25384184365244350738…82576294281302958081
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,714,121 XPM·at block #6,808,758 · 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