Block #466,513

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/30/2014, 5:40:48 AM · Difficulty 10.4213 · 6,364,370 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
deb7b9088698224ef17cfd025b950bff5d9c0cbf5cdbb99e6e7427e4495269f0

Height

#466,513

Difficulty

10.421317

Transactions

5

Size

3.10 KB

Version

2

Bits

0a6bdb74

Nonce

42,896

Timestamp

3/30/2014, 5:40:48 AM

Confirmations

6,364,370

Merkle Root

0fe734c8555cfbf51909c3baabb0a50c02a3f157f415135d4fb61a3ca2cdaa51
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.980 × 10⁹⁶(97-digit number)
39802007987778654289…59574175256324848641
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.980 × 10⁹⁶(97-digit number)
39802007987778654289…59574175256324848641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.960 × 10⁹⁶(97-digit number)
79604015975557308579…19148350512649697281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.592 × 10⁹⁷(98-digit number)
15920803195111461715…38296701025299394561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.184 × 10⁹⁷(98-digit number)
31841606390222923431…76593402050598789121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.368 × 10⁹⁷(98-digit number)
63683212780445846863…53186804101197578241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.273 × 10⁹⁸(99-digit number)
12736642556089169372…06373608202395156481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.547 × 10⁹⁸(99-digit number)
25473285112178338745…12747216404790312961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.094 × 10⁹⁸(99-digit number)
50946570224356677490…25494432809580625921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.018 × 10⁹⁹(100-digit number)
10189314044871335498…50988865619161251841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.037 × 10⁹⁹(100-digit number)
20378628089742670996…01977731238322503681
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,891,200 XPM·at block #6,830,882 · 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