Block #645,891

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/24/2014, 10:43:36 AM · Difficulty 10.9528 · 6,172,054 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
477efcfb6fc3a69365e5ca9ba4d0ec0ee32ef581eabf20e128cca8e3c33134a4

Height

#645,891

Difficulty

10.952836

Transactions

3

Size

1.22 KB

Version

2

Bits

0af3ed14

Nonce

772,577,446

Timestamp

7/24/2014, 10:43:36 AM

Confirmations

6,172,054

Merkle Root

af0fb2c455e7ad8e4b6d22b9d7951170ead3b8c58d907ea0207ce63983ea6d03
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.947 × 10⁹⁴(95-digit number)
19471885747977108622…93061991508866342279
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.947 × 10⁹⁴(95-digit number)
19471885747977108622…93061991508866342279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.894 × 10⁹⁴(95-digit number)
38943771495954217244…86123983017732684559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.788 × 10⁹⁴(95-digit number)
77887542991908434488…72247966035465369119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.557 × 10⁹⁵(96-digit number)
15577508598381686897…44495932070930738239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.115 × 10⁹⁵(96-digit number)
31155017196763373795…88991864141861476479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.231 × 10⁹⁵(96-digit number)
62310034393526747591…77983728283722952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.246 × 10⁹⁶(97-digit number)
12462006878705349518…55967456567445905919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.492 × 10⁹⁶(97-digit number)
24924013757410699036…11934913134891811839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.984 × 10⁹⁶(97-digit number)
49848027514821398072…23869826269783623679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.969 × 10⁹⁶(97-digit number)
99696055029642796145…47739652539567247359
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,787,627 XPM·at block #6,817,944 · 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