Block #468,521

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2014, 1:42:26 PM · Difficulty 10.4320 · 6,348,289 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cdade840d85ba0ccc27cdfe414451ddd069108433b8e1aa87c1d9ad1d4e7fe96

Height

#468,521

Difficulty

10.432029

Transactions

1

Size

865 B

Version

2

Bits

0a6e997b

Nonce

144,398

Timestamp

3/31/2014, 1:42:26 PM

Confirmations

6,348,289

Merkle Root

92859e535ce845caac3a9114590cc99bde7652075e120ca9af0a2e4e9e7170cd
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.773 × 10⁹⁰(91-digit number)
37735407802268197813…57222714454255016801
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.773 × 10⁹⁰(91-digit number)
37735407802268197813…57222714454255016801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.547 × 10⁹⁰(91-digit number)
75470815604536395627…14445428908510033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.509 × 10⁹¹(92-digit number)
15094163120907279125…28890857817020067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.018 × 10⁹¹(92-digit number)
30188326241814558251…57781715634040134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.037 × 10⁹¹(92-digit number)
60376652483629116502…15563431268080268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.207 × 10⁹²(93-digit number)
12075330496725823300…31126862536160537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.415 × 10⁹²(93-digit number)
24150660993451646600…62253725072321075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.830 × 10⁹²(93-digit number)
48301321986903293201…24507450144642150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.660 × 10⁹²(93-digit number)
96602643973806586403…49014900289284300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.932 × 10⁹³(94-digit number)
19320528794761317280…98029800578568601601
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,778,517 XPM·at block #6,816,809 · 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