Block #437,027

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 12:28:23 AM · Difficulty 10.3587 · 6,405,919 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cebd7cf4fa84a37eb0a9c60f3caca05f2674311d92d3ccbc5a9c535cd48e1577

Height

#437,027

Difficulty

10.358720

Transactions

1

Size

1003 B

Version

2

Bits

0a5bd50c

Nonce

28,783

Timestamp

3/10/2014, 12:28:23 AM

Confirmations

6,405,919

Merkle Root

364dc25dc11bf73c573634c9bfda5313e75e4aa31ea1796826e6e2cce9517e66
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.

1.440 × 10⁹⁵(96-digit number)
14406823220791900252…46355641575909328661
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
1.440 × 10⁹⁵(96-digit number)
14406823220791900252…46355641575909328661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.881 × 10⁹⁵(96-digit number)
28813646441583800505…92711283151818657321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.762 × 10⁹⁵(96-digit number)
57627292883167601011…85422566303637314641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.152 × 10⁹⁶(97-digit number)
11525458576633520202…70845132607274629281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.305 × 10⁹⁶(97-digit number)
23050917153267040404…41690265214549258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.610 × 10⁹⁶(97-digit number)
46101834306534080809…83380530429098517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.220 × 10⁹⁶(97-digit number)
92203668613068161618…66761060858197034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.844 × 10⁹⁷(98-digit number)
18440733722613632323…33522121716394068481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.688 × 10⁹⁷(98-digit number)
36881467445227264647…67044243432788136961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.376 × 10⁹⁷(98-digit number)
73762934890454529294…34088486865576273921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.475 × 10⁹⁸(99-digit number)
14752586978090905858…68176973731152547841
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,987,919 XPM·at block #6,842,945 · 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