Block #603,219

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/26/2014, 9:01:03 PM · Difficulty 10.9126 · 6,207,789 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
78bbd2471f2aab1c05bdcbc0d14dd43767392a0cb5daeafd6d4da45ce38980f6

Height

#603,219

Difficulty

10.912560

Transactions

13

Size

3.00 KB

Version

2

Bits

0ae99d81

Nonce

35,380,330

Timestamp

6/26/2014, 9:01:03 PM

Confirmations

6,207,789

Merkle Root

141036c69ee05e2f5ece4ca8880e98ab125b6af09bab243fe92df00bbd2087b8
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.942 × 10⁹⁷(98-digit number)
79421009672977436625…23253743126861580799
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.942 × 10⁹⁷(98-digit number)
79421009672977436625…23253743126861580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.588 × 10⁹⁸(99-digit number)
15884201934595487325…46507486253723161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.176 × 10⁹⁸(99-digit number)
31768403869190974650…93014972507446323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.353 × 10⁹⁸(99-digit number)
63536807738381949300…86029945014892646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.270 × 10⁹⁹(100-digit number)
12707361547676389860…72059890029785292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.541 × 10⁹⁹(100-digit number)
25414723095352779720…44119780059570585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.082 × 10⁹⁹(100-digit number)
50829446190705559440…88239560119141171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.016 × 10¹⁰⁰(101-digit number)
10165889238141111888…76479120238282342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.033 × 10¹⁰⁰(101-digit number)
20331778476282223776…52958240476564684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.066 × 10¹⁰⁰(101-digit number)
40663556952564447552…05916480953129369599
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,732,168 XPM·at block #6,811,007 · 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