Block #2,218,738

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/23/2017, 4:25:16 AM · Difficulty 10.9445 · 4,621,045 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
57536004ad3fb714d3fe6a15b2aeec43cdb6f6ef142086d67b1206be898c4679

Height

#2,218,738

Difficulty

10.944477

Transactions

5

Size

1.06 KB

Version

2

Bits

0af1c945

Nonce

852,411,007

Timestamp

7/23/2017, 4:25:16 AM

Confirmations

4,621,045

Merkle Root

cdd6d51e835116d26263f70de9131db2bc5ea4714fa74279105745832dec540e
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.168 × 10⁹⁵(96-digit number)
11684143666668422194…84685564372117099519
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.168 × 10⁹⁵(96-digit number)
11684143666668422194…84685564372117099519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.336 × 10⁹⁵(96-digit number)
23368287333336844389…69371128744234199039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.673 × 10⁹⁵(96-digit number)
46736574666673688778…38742257488468398079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.347 × 10⁹⁵(96-digit number)
93473149333347377557…77484514976936796159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.869 × 10⁹⁶(97-digit number)
18694629866669475511…54969029953873592319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.738 × 10⁹⁶(97-digit number)
37389259733338951023…09938059907747184639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.477 × 10⁹⁶(97-digit number)
74778519466677902046…19876119815494369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.495 × 10⁹⁷(98-digit number)
14955703893335580409…39752239630988738559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.991 × 10⁹⁷(98-digit number)
29911407786671160818…79504479261977477119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.982 × 10⁹⁷(98-digit number)
59822815573342321636…59008958523954954239
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,962,554 XPM·at block #6,839,782 · 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