Block #507,786

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 11:07:27 PM · Difficulty 10.8175 · 6,306,691 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
376077bc5694f116144d057f963d9d84fab08ba864dfa8e2f4df390fe1313288

Height

#507,786

Difficulty

10.817493

Transactions

1

Size

835 B

Version

2

Bits

0ad14738

Nonce

859,689,179

Timestamp

4/23/2014, 11:07:27 PM

Confirmations

6,306,691

Merkle Root

7c837169e64a77263c09ea4e0c13368291a2c2f682db5eb3e109361b1999bcca
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.128 × 10¹⁰⁰(101-digit number)
21289587010561897461…12056594826055495681
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.128 × 10¹⁰⁰(101-digit number)
21289587010561897461…12056594826055495681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.257 × 10¹⁰⁰(101-digit number)
42579174021123794923…24113189652110991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.515 × 10¹⁰⁰(101-digit number)
85158348042247589847…48226379304221982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.703 × 10¹⁰¹(102-digit number)
17031669608449517969…96452758608443965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.406 × 10¹⁰¹(102-digit number)
34063339216899035938…92905517216887930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.812 × 10¹⁰¹(102-digit number)
68126678433798071877…85811034433775861761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.362 × 10¹⁰²(103-digit number)
13625335686759614375…71622068867551723521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.725 × 10¹⁰²(103-digit number)
27250671373519228751…43244137735103447041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.450 × 10¹⁰²(103-digit number)
54501342747038457502…86488275470206894081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.090 × 10¹⁰³(104-digit number)
10900268549407691500…72976550940413788161
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,759,891 XPM·at block #6,814,476 · 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