Block #460,564

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/26/2014, 2:51:28 AM · Difficulty 10.4160 · 6,347,731 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
abfefe07dddf3b553699de741b5f89943b28bb0ea9d7b88759c719a6e43b913a

Height

#460,564

Difficulty

10.416015

Transactions

6

Size

3.50 KB

Version

2

Bits

0a6a7ff9

Nonce

67,116

Timestamp

3/26/2014, 2:51:28 AM

Confirmations

6,347,731

Merkle Root

c41788f2a1f1f8b35a2eb4aa2bd6318426d326d05fe0cc1f82caaeb307841c27
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.

7.337 × 10⁹⁷(98-digit number)
73377574769729183939…63184123568014201601
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
7.337 × 10⁹⁷(98-digit number)
73377574769729183939…63184123568014201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.467 × 10⁹⁸(99-digit number)
14675514953945836787…26368247136028403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.935 × 10⁹⁸(99-digit number)
29351029907891673575…52736494272056806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.870 × 10⁹⁸(99-digit number)
58702059815783347151…05472988544113612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.174 × 10⁹⁹(100-digit number)
11740411963156669430…10945977088227225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.348 × 10⁹⁹(100-digit number)
23480823926313338860…21891954176454451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.696 × 10⁹⁹(100-digit number)
46961647852626677721…43783908352908902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.392 × 10⁹⁹(100-digit number)
93923295705253355442…87567816705817804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.878 × 10¹⁰⁰(101-digit number)
18784659141050671088…75135633411635609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.756 × 10¹⁰⁰(101-digit number)
37569318282101342177…50271266823271219201
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,413 XPM·at block #6,808,294 · 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