Block #567,373

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/29/2014, 4:41:37 PM · Difficulty 10.9649 · 6,249,102 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3871daab7fae72aaf0b04497fbd861e40f6950d869d9b863aecff71d2918bd93

Height

#567,373

Difficulty

10.964876

Transactions

12

Size

10.87 KB

Version

2

Bits

0af70220

Nonce

303,909,736

Timestamp

5/29/2014, 4:41:37 PM

Confirmations

6,249,102

Merkle Root

a9ef0099c8cd05c1f3ea230ac1e08eaed2a7ebc34156bc6541261e272c307522
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.

2.834 × 10⁹⁸(99-digit number)
28346890614844839072…03597413437097676161
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
2.834 × 10⁹⁸(99-digit number)
28346890614844839072…03597413437097676161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.669 × 10⁹⁸(99-digit number)
56693781229689678145…07194826874195352321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.133 × 10⁹⁹(100-digit number)
11338756245937935629…14389653748390704641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.267 × 10⁹⁹(100-digit number)
22677512491875871258…28779307496781409281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.535 × 10⁹⁹(100-digit number)
45355024983751742516…57558614993562818561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.071 × 10⁹⁹(100-digit number)
90710049967503485032…15117229987125637121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.814 × 10¹⁰⁰(101-digit number)
18142009993500697006…30234459974251274241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.628 × 10¹⁰⁰(101-digit number)
36284019987001394013…60468919948502548481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.256 × 10¹⁰⁰(101-digit number)
72568039974002788026…20937839897005096961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.451 × 10¹⁰¹(102-digit number)
14513607994800557605…41875679794010193921
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,775,930 XPM·at block #6,816,474 · 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