Block #414,722

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/22/2014, 5:50:48 AM · Difficulty 10.3983 · 6,391,990 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cc25c96603d62ddeeac59177c61807c95970e5b9acd0a80387628acb2c377e8c

Height

#414,722

Difficulty

10.398266

Transactions

2

Size

751 B

Version

2

Bits

0a65f4c9

Nonce

320,398

Timestamp

2/22/2014, 5:50:48 AM

Confirmations

6,391,990

Merkle Root

2b67c2fc3a70ab7b1ad51e5a974904aed9e704cb174defeec91d6ea3810a6010
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.

5.905 × 10⁹⁹(100-digit number)
59053162562537399362…25525313090750520801
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
5.905 × 10⁹⁹(100-digit number)
59053162562537399362…25525313090750520801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.181 × 10¹⁰⁰(101-digit number)
11810632512507479872…51050626181501041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.362 × 10¹⁰⁰(101-digit number)
23621265025014959745…02101252363002083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.724 × 10¹⁰⁰(101-digit number)
47242530050029919490…04202504726004166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.448 × 10¹⁰⁰(101-digit number)
94485060100059838980…08405009452008332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.889 × 10¹⁰¹(102-digit number)
18897012020011967796…16810018904016665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.779 × 10¹⁰¹(102-digit number)
37794024040023935592…33620037808033331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.558 × 10¹⁰¹(102-digit number)
75588048080047871184…67240075616066662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.511 × 10¹⁰²(103-digit number)
15117609616009574236…34480151232133324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.023 × 10¹⁰²(103-digit number)
30235219232019148473…68960302464266649601
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,697,794 XPM·at block #6,806,711 · 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