Block #423,775

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 3:57:23 PM · Difficulty 10.3788 · 6,390,270 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
babfc9a52c5f9f7421c63b65df1b7658b9cc754f9e891a3caa66d29e960b4442

Height

#423,775

Difficulty

10.378775

Transactions

16

Size

4.17 KB

Version

2

Bits

0a60f764

Nonce

48,286

Timestamp

2/28/2014, 3:57:23 PM

Confirmations

6,390,270

Merkle Root

0e113e2990a7580e49de075cbf87cf0ae89f09a7605ad35b4390596cbf0959b5
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.406 × 10⁹²(93-digit number)
24062158271703671636…22008956036995224641
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.406 × 10⁹²(93-digit number)
24062158271703671636…22008956036995224641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.812 × 10⁹²(93-digit number)
48124316543407343272…44017912073990449281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.624 × 10⁹²(93-digit number)
96248633086814686545…88035824147980898561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.924 × 10⁹³(94-digit number)
19249726617362937309…76071648295961797121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.849 × 10⁹³(94-digit number)
38499453234725874618…52143296591923594241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.699 × 10⁹³(94-digit number)
76998906469451749236…04286593183847188481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.539 × 10⁹⁴(95-digit number)
15399781293890349847…08573186367694376961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.079 × 10⁹⁴(95-digit number)
30799562587780699694…17146372735388753921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.159 × 10⁹⁴(95-digit number)
61599125175561399389…34292745470777507841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.231 × 10⁹⁵(96-digit number)
12319825035112279877…68585490941555015681
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,756,436 XPM·at block #6,814,044 · 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