Block #437,652

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 11:15:15 AM · Difficulty 10.3584 · 6,380,146 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6ae6ff7ad5b6a7835c9dbc01a0f801f6425bce158986d533e9f732e1c3df3d6

Height

#437,652

Difficulty

10.358419

Transactions

4

Size

2.06 KB

Version

2

Bits

0a5bc154

Nonce

59,993

Timestamp

3/10/2014, 11:15:15 AM

Confirmations

6,380,146

Merkle Root

31886edd70695467b1466947604d5cfa14eb9f8a966797a0915408fc395a6565
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.

4.305 × 10¹⁰¹(102-digit number)
43059425726416041568…91825928225218760641
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
4.305 × 10¹⁰¹(102-digit number)
43059425726416041568…91825928225218760641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.611 × 10¹⁰¹(102-digit number)
86118851452832083137…83651856450437521281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.722 × 10¹⁰²(103-digit number)
17223770290566416627…67303712900875042561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.444 × 10¹⁰²(103-digit number)
34447540581132833255…34607425801750085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.889 × 10¹⁰²(103-digit number)
68895081162265666510…69214851603500170241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.377 × 10¹⁰³(104-digit number)
13779016232453133302…38429703207000340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.755 × 10¹⁰³(104-digit number)
27558032464906266604…76859406414000680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.511 × 10¹⁰³(104-digit number)
55116064929812533208…53718812828001361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.102 × 10¹⁰⁴(105-digit number)
11023212985962506641…07437625656002723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.204 × 10¹⁰⁴(105-digit number)
22046425971925013283…14875251312005447681
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,786,444 XPM·at block #6,817,797 · 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