Block #427,307

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 7:15:42 AM · Difficulty 10.3470 · 6,385,171 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ea29f73ecf4dd942e94aa55d57b9bca5287104542ef9af7c562a2ee1db9110f

Height

#427,307

Difficulty

10.346994

Transactions

6

Size

2.49 KB

Version

2

Bits

0a58d49a

Nonce

526,566

Timestamp

3/3/2014, 7:15:42 AM

Confirmations

6,385,171

Merkle Root

bdf0ce15aa4b12a95f086211b16bc2280c2463695d3f22c8170d20fe16836db2
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.138 × 10⁹⁹(100-digit number)
11383981174454917505…42181835365380400321
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.138 × 10⁹⁹(100-digit number)
11383981174454917505…42181835365380400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.276 × 10⁹⁹(100-digit number)
22767962348909835011…84363670730760800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.553 × 10⁹⁹(100-digit number)
45535924697819670023…68727341461521601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.107 × 10⁹⁹(100-digit number)
91071849395639340047…37454682923043202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.821 × 10¹⁰⁰(101-digit number)
18214369879127868009…74909365846086405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.642 × 10¹⁰⁰(101-digit number)
36428739758255736018…49818731692172810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.285 × 10¹⁰⁰(101-digit number)
72857479516511472037…99637463384345620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.457 × 10¹⁰¹(102-digit number)
14571495903302294407…99274926768691240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.914 × 10¹⁰¹(102-digit number)
29142991806604588815…98549853537382481921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.828 × 10¹⁰¹(102-digit number)
58285983613209177630…97099707074764963841
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,743,852 XPM·at block #6,812,477 · 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