Block #1,004,689

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/6/2015, 2:22:46 PM · Difficulty 10.7421 · 5,803,432 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
41ffc79b8cb0b8abeeae9a2c599d0fcdd4a8e174594e93f585218a9d6fc273b8

Height

#1,004,689

Difficulty

10.742063

Transactions

5

Size

94.18 KB

Version

2

Bits

0abdf7cf

Nonce

181,647,576

Timestamp

4/6/2015, 2:22:46 PM

Confirmations

5,803,432

Merkle Root

75ee5d33954f1c63268e13236d28a2e965de2d578043d0fe81c09ed7608d2fec
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.707 × 10⁹⁷(98-digit number)
27073862273094760885…88895695270545811199
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.707 × 10⁹⁷(98-digit number)
27073862273094760885…88895695270545811199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.414 × 10⁹⁷(98-digit number)
54147724546189521771…77791390541091622399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.082 × 10⁹⁸(99-digit number)
10829544909237904354…55582781082183244799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.165 × 10⁹⁸(99-digit number)
21659089818475808708…11165562164366489599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.331 × 10⁹⁸(99-digit number)
43318179636951617417…22331124328732979199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.663 × 10⁹⁸(99-digit number)
86636359273903234834…44662248657465958399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.732 × 10⁹⁹(100-digit number)
17327271854780646966…89324497314931916799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.465 × 10⁹⁹(100-digit number)
34654543709561293933…78648994629863833599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.930 × 10⁹⁹(100-digit number)
69309087419122587867…57297989259727667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.386 × 10¹⁰⁰(101-digit number)
13861817483824517573…14595978519455334399
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,709,008 XPM·at block #6,808,120 · 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