Block #452,682

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 5:54:07 PM · Difficulty 10.3932 · 6,361,675 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a9cc7b8fbe34f27acd7ad64a1478563044d68d18e485054e7f8bf684736fd6c2

Height

#452,682

Difficulty

10.393234

Transactions

1

Size

1002 B

Version

2

Bits

0a64aaf5

Nonce

82,481

Timestamp

3/20/2014, 5:54:07 PM

Confirmations

6,361,675

Merkle Root

85f721497675fe433862ad3f3b0b3b9a2bead5840662ec887a3e94e0b7a1195f
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.438 × 10⁹³(94-digit number)
14387426136784363375…28992237291658649601
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.438 × 10⁹³(94-digit number)
14387426136784363375…28992237291658649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.877 × 10⁹³(94-digit number)
28774852273568726750…57984474583317299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.754 × 10⁹³(94-digit number)
57549704547137453500…15968949166634598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.150 × 10⁹⁴(95-digit number)
11509940909427490700…31937898333269196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.301 × 10⁹⁴(95-digit number)
23019881818854981400…63875796666538393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.603 × 10⁹⁴(95-digit number)
46039763637709962800…27751593333076787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.207 × 10⁹⁴(95-digit number)
92079527275419925601…55503186666153574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.841 × 10⁹⁵(96-digit number)
18415905455083985120…11006373332307148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.683 × 10⁹⁵(96-digit number)
36831810910167970240…22012746664614297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.366 × 10⁹⁵(96-digit number)
73663621820335940481…44025493329228595201
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,758,922 XPM·at block #6,814,356 · 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