Block #437,707

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 11:51:51 AM · Difficulty 10.3585 · 6,380,210 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b7a09d96268d777e385d14da48239ab315a25a81e2d8851021d967fd28253c5

Height

#437,707

Difficulty

10.358455

Transactions

2

Size

427 B

Version

2

Bits

0a5bc3ae

Nonce

11,864

Timestamp

3/10/2014, 11:51:51 AM

Confirmations

6,380,210

Merkle Root

00efbdfa480d09b802b6378002d7f777da42f9aa8c2ca942318e81c311f4196c
Transactions (2)
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.

4.731 × 10⁹⁴(95-digit number)
47311788192491250338…04535810064766954561
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
4.731 × 10⁹⁴(95-digit number)
47311788192491250338…04535810064766954561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.462 × 10⁹⁴(95-digit number)
94623576384982500677…09071620129533909121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.892 × 10⁹⁵(96-digit number)
18924715276996500135…18143240259067818241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.784 × 10⁹⁵(96-digit number)
37849430553993000270…36286480518135636481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.569 × 10⁹⁵(96-digit number)
75698861107986000541…72572961036271272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.513 × 10⁹⁶(97-digit number)
15139772221597200108…45145922072542545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.027 × 10⁹⁶(97-digit number)
30279544443194400216…90291844145085091841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.055 × 10⁹⁶(97-digit number)
60559088886388800433…80583688290170183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.211 × 10⁹⁷(98-digit number)
12111817777277760086…61167376580340367361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.422 × 10⁹⁷(98-digit number)
24223635554555520173…22334753160680734721
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,787,401 XPM·at block #6,817,916 · 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