Block #436,478

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/9/2014, 3:00:45 PM · Difficulty 10.3614 · 6,390,407 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b5e545d8e721815c13d0f77be806c19402d6759190d9dd32bbf98e5d5866f31f

Height

#436,478

Difficulty

10.361362

Transactions

4

Size

1.57 KB

Version

2

Bits

0a5c823f

Nonce

69,663

Timestamp

3/9/2014, 3:00:45 PM

Confirmations

6,390,407

Merkle Root

6779c7566a5d21e08ad03cdfb6ce3bc2043186e6eeeb3c9f184d5c360e11e5f5
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.

3.497 × 10⁹³(94-digit number)
34976815780202938059…37413781284609068161
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
3.497 × 10⁹³(94-digit number)
34976815780202938059…37413781284609068161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.995 × 10⁹³(94-digit number)
69953631560405876119…74827562569218136321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.399 × 10⁹⁴(95-digit number)
13990726312081175223…49655125138436272641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.798 × 10⁹⁴(95-digit number)
27981452624162350447…99310250276872545281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.596 × 10⁹⁴(95-digit number)
55962905248324700895…98620500553745090561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.119 × 10⁹⁵(96-digit number)
11192581049664940179…97241001107490181121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.238 × 10⁹⁵(96-digit number)
22385162099329880358…94482002214980362241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.477 × 10⁹⁵(96-digit number)
44770324198659760716…88964004429960724481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.954 × 10⁹⁵(96-digit number)
89540648397319521432…77928008859921448961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.790 × 10⁹⁶(97-digit number)
17908129679463904286…55856017719842897921
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,859,245 XPM·at block #6,826,884 · 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