Block #472,045

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2014, 12:28:10 AM · Difficulty 10.4342 · 6,345,316 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8dd9c109abcc3c414715b49508bcfc799c376654229384007eb331df0ce0da56

Height

#472,045

Difficulty

10.434155

Transactions

4

Size

4.06 KB

Version

2

Bits

0a6f24c7

Nonce

149,115

Timestamp

4/3/2014, 12:28:10 AM

Confirmations

6,345,316

Merkle Root

5b694b2571d9ec543e048b3cff162f55c5c07a3eaddfe7648eee088cef3c85eb
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.372 × 10⁹⁶(97-digit number)
23724392236288344107…63885311729633408899
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.372 × 10⁹⁶(97-digit number)
23724392236288344107…63885311729633408899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.744 × 10⁹⁶(97-digit number)
47448784472576688214…27770623459266817799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.489 × 10⁹⁶(97-digit number)
94897568945153376429…55541246918533635599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.897 × 10⁹⁷(98-digit number)
18979513789030675285…11082493837067271199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.795 × 10⁹⁷(98-digit number)
37959027578061350571…22164987674134542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.591 × 10⁹⁷(98-digit number)
75918055156122701143…44329975348269084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.518 × 10⁹⁸(99-digit number)
15183611031224540228…88659950696538169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.036 × 10⁹⁸(99-digit number)
30367222062449080457…77319901393076339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.073 × 10⁹⁸(99-digit number)
60734444124898160914…54639802786152678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.214 × 10⁹⁹(100-digit number)
12146888824979632182…09279605572305356799
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,782,937 XPM·at block #6,817,360 · 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