Block #437,201

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 3:37:07 AM · Difficulty 10.3572 · 6,379,766 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aaf184c4248fc4b885d03b4ba21159b5e74fee414696c8c5a0a32c1023f553fa

Height

#437,201

Difficulty

10.357167

Transactions

6

Size

1.59 KB

Version

2

Bits

0a5b6f4b

Nonce

137,244

Timestamp

3/10/2014, 3:37:07 AM

Confirmations

6,379,766

Merkle Root

728e7d662329cf370d8b9230601b09123bca50a34152895c27915371b49e0823
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.966 × 10⁹⁹(100-digit number)
29663229500742479128…18167192001938872411
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.966 × 10⁹⁹(100-digit number)
29663229500742479128…18167192001938872411
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.932 × 10⁹⁹(100-digit number)
59326459001484958256…36334384003877744821
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.186 × 10¹⁰⁰(101-digit number)
11865291800296991651…72668768007755489641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.373 × 10¹⁰⁰(101-digit number)
23730583600593983302…45337536015510979281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.746 × 10¹⁰⁰(101-digit number)
47461167201187966605…90675072031021958561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.492 × 10¹⁰⁰(101-digit number)
94922334402375933210…81350144062043917121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.898 × 10¹⁰¹(102-digit number)
18984466880475186642…62700288124087834241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.796 × 10¹⁰¹(102-digit number)
37968933760950373284…25400576248175668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.593 × 10¹⁰¹(102-digit number)
75937867521900746568…50801152496351336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.518 × 10¹⁰²(103-digit number)
15187573504380149313…01602304992702673921
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,779,773 XPM·at block #6,816,966 · 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