Block #454,666

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/22/2014, 2:41:33 AM · Difficulty 10.3964 · 6,360,279 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
75a70dadddc32ff74ad43918e018cd919e10a298726ac4b2c2255545fe240e15

Height

#454,666

Difficulty

10.396434

Transactions

2

Size

1.13 KB

Version

2

Bits

0a657cb7

Nonce

80,109

Timestamp

3/22/2014, 2:41:33 AM

Confirmations

6,360,279

Merkle Root

558390f77245da3d0d2f92ff7832e1681b4fdbdaf9bc20b0ed295066e98b8243
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.514 × 10⁹¹(92-digit number)
15148124893810935536…94490341924519978701
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.514 × 10⁹¹(92-digit number)
15148124893810935536…94490341924519978701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.029 × 10⁹¹(92-digit number)
30296249787621871072…88980683849039957401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.059 × 10⁹¹(92-digit number)
60592499575243742144…77961367698079914801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.211 × 10⁹²(93-digit number)
12118499915048748428…55922735396159829601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.423 × 10⁹²(93-digit number)
24236999830097496857…11845470792319659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.847 × 10⁹²(93-digit number)
48473999660194993715…23690941584639318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.694 × 10⁹²(93-digit number)
96947999320389987430…47381883169278636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.938 × 10⁹³(94-digit number)
19389599864077997486…94763766338557273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.877 × 10⁹³(94-digit number)
38779199728155994972…89527532677114547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.755 × 10⁹³(94-digit number)
77558399456311989944…79055065354229094401
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,763,656 XPM·at block #6,814,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