Block #423,071

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 5:35:37 AM · Difficulty 10.3683 · 6,384,125 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b15c3433a7dc818fa8681cce0dec0fb458a5bbb8ed9cacfdbe8f792e1d2eeb87

Height

#423,071

Difficulty

10.368260

Transactions

7

Size

2.09 KB

Version

2

Bits

0a5e464d

Nonce

631,858

Timestamp

2/28/2014, 5:35:37 AM

Confirmations

6,384,125

Merkle Root

ca5580795000497010eac15f53e27eff6948e52259f4c56ca99b5e4729e5a246
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.011 × 10⁹⁵(96-digit number)
30115506072028957547…28205117454232888321
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.011 × 10⁹⁵(96-digit number)
30115506072028957547…28205117454232888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.023 × 10⁹⁵(96-digit number)
60231012144057915094…56410234908465776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.204 × 10⁹⁶(97-digit number)
12046202428811583018…12820469816931553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.409 × 10⁹⁶(97-digit number)
24092404857623166037…25640939633863106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.818 × 10⁹⁶(97-digit number)
48184809715246332075…51281879267726213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.636 × 10⁹⁶(97-digit number)
96369619430492664150…02563758535452426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.927 × 10⁹⁷(98-digit number)
19273923886098532830…05127517070904852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.854 × 10⁹⁷(98-digit number)
38547847772197065660…10255034141809704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.709 × 10⁹⁷(98-digit number)
77095695544394131320…20510068283619409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.541 × 10⁹⁸(99-digit number)
15419139108878826264…41020136567238819841
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,701,581 XPM·at block #6,807,195 · 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