Block #470,571

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/2/2014, 12:17:31 AM · Difficulty 10.4309 · 6,338,456 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d56009f658112b1cae2c40cbb2d7fe86643f47fe0cb46e4c346e203b940db562

Height

#470,571

Difficulty

10.430938

Transactions

9

Size

3.01 KB

Version

2

Bits

0a6e51ec

Nonce

201,328,726

Timestamp

4/2/2014, 12:17:31 AM

Confirmations

6,338,456

Merkle Root

8ca3d054113de39545dd02038a22f1496ceb4ec6143682f657d7aec1f1684fba
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.

7.899 × 10⁹³(94-digit number)
78999446019263419281…97207368388594962439
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
7.899 × 10⁹³(94-digit number)
78999446019263419281…97207368388594962439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.579 × 10⁹⁴(95-digit number)
15799889203852683856…94414736777189924879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.159 × 10⁹⁴(95-digit number)
31599778407705367712…88829473554379849759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.319 × 10⁹⁴(95-digit number)
63199556815410735425…77658947108759699519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.263 × 10⁹⁵(96-digit number)
12639911363082147085…55317894217519399039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.527 × 10⁹⁵(96-digit number)
25279822726164294170…10635788435038798079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.055 × 10⁹⁵(96-digit number)
50559645452328588340…21271576870077596159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.011 × 10⁹⁶(97-digit number)
10111929090465717668…42543153740155192319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.022 × 10⁹⁶(97-digit number)
20223858180931435336…85086307480310384639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.044 × 10⁹⁶(97-digit number)
40447716361862870672…70172614960620769279
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:57,716,279 XPM·at block #6,809,026 · 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