Block #412,234

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2014, 9:33:39 AM · Difficulty 10.4172 · 6,394,426 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee8a98ead71ebb48e273f4b6ab8fad8e7f2d3e68322fee07d006c9dbdfc317c2

Height

#412,234

Difficulty

10.417212

Transactions

6

Size

1.32 KB

Version

2

Bits

0a6ace63

Nonce

404,105

Timestamp

2/20/2014, 9:33:39 AM

Confirmations

6,394,426

Merkle Root

2b6076def08b66e5fd633b969c8a0612c8affc890f9829514175a9a78b84d258
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.

6.268 × 10⁹⁷(98-digit number)
62683733804889968653…01781315397343196799
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
6.268 × 10⁹⁷(98-digit number)
62683733804889968653…01781315397343196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.253 × 10⁹⁸(99-digit number)
12536746760977993730…03562630794686393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.507 × 10⁹⁸(99-digit number)
25073493521955987461…07125261589372787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.014 × 10⁹⁸(99-digit number)
50146987043911974922…14250523178745574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.002 × 10⁹⁹(100-digit number)
10029397408782394984…28501046357491148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.005 × 10⁹⁹(100-digit number)
20058794817564789969…57002092714982297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.011 × 10⁹⁹(100-digit number)
40117589635129579938…14004185429964595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.023 × 10⁹⁹(100-digit number)
80235179270259159876…28008370859929190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.604 × 10¹⁰⁰(101-digit number)
16047035854051831975…56016741719858380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.209 × 10¹⁰⁰(101-digit number)
32094071708103663950…12033483439716761599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,697,377 XPM·at block #6,806,659 · 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