Block #480,462

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/8/2014, 8:00:30 AM · Difficulty 10.5169 · 6,327,860 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a9ac1deb802f6988af62ac34eb6f1b882667258a7fabbc632053ac2d35b7dc0

Height

#480,462

Difficulty

10.516883

Transactions

3

Size

659 B

Version

2

Bits

0a845273

Nonce

87,002,642

Timestamp

4/8/2014, 8:00:30 AM

Confirmations

6,327,860

Merkle Root

0fdbc0c658749c0dd302c92f75d7436fe0052ce089f6f5203f7d63084723ede0
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.781 × 10⁹⁷(98-digit number)
27815808128567768207…03487055560893687961
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.781 × 10⁹⁷(98-digit number)
27815808128567768207…03487055560893687961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.563 × 10⁹⁷(98-digit number)
55631616257135536415…06974111121787375921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.112 × 10⁹⁸(99-digit number)
11126323251427107283…13948222243574751841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.225 × 10⁹⁸(99-digit number)
22252646502854214566…27896444487149503681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.450 × 10⁹⁸(99-digit number)
44505293005708429132…55792888974299007361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.901 × 10⁹⁸(99-digit number)
89010586011416858265…11585777948598014721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.780 × 10⁹⁹(100-digit number)
17802117202283371653…23171555897196029441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.560 × 10⁹⁹(100-digit number)
35604234404566743306…46343111794392058881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.120 × 10⁹⁹(100-digit number)
71208468809133486612…92686223588784117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.424 × 10¹⁰⁰(101-digit number)
14241693761826697322…85372447177568235521
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,710,630 XPM·at block #6,808,321 · 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.

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