Block #610,504

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/1/2014, 6:00:47 PM · Difficulty 10.9173 · 6,199,459 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cd93b6f6f200d79a03fbeefd46376d423da2f05e9c57bfe92cd0a35a8f0889b4

Height

#610,504

Difficulty

10.917289

Transactions

2

Size

433 B

Version

2

Bits

0aead370

Nonce

747,339,174

Timestamp

7/1/2014, 6:00:47 PM

Confirmations

6,199,459

Merkle Root

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

1.412 × 10⁹⁷(98-digit number)
14121669620876747407…02247361624434890241
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.412 × 10⁹⁷(98-digit number)
14121669620876747407…02247361624434890241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.824 × 10⁹⁷(98-digit number)
28243339241753494814…04494723248869780481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.648 × 10⁹⁷(98-digit number)
56486678483506989628…08989446497739560961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.129 × 10⁹⁸(99-digit number)
11297335696701397925…17978892995479121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.259 × 10⁹⁸(99-digit number)
22594671393402795851…35957785990958243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.518 × 10⁹⁸(99-digit number)
45189342786805591702…71915571981916487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.037 × 10⁹⁸(99-digit number)
90378685573611183405…43831143963832975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.807 × 10⁹⁹(100-digit number)
18075737114722236681…87662287927665950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.615 × 10⁹⁹(100-digit number)
36151474229444473362…75324575855331901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.230 × 10⁹⁹(100-digit number)
72302948458888946724…50649151710663802881
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,723,776 XPM·at block #6,809,962 · 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