Block #414,205

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/21/2014, 7:43:32 PM · Difficulty 10.4092 · 6,428,809 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e628986ee3cebd388281092b7a868ed4dedd1f6202a9f66cf4072fed58c6f307

Height

#414,205

Difficulty

10.409150

Transactions

2

Size

1.17 KB

Version

2

Bits

0a68be11

Nonce

385,424

Timestamp

2/21/2014, 7:43:32 PM

Confirmations

6,428,809

Merkle Root

0d234bff3659642bee401983b2970311ec665eb95136c77b700350ae84136707
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.049 × 10⁹⁶(97-digit number)
10492084368501468990…74997268199096186799
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.049 × 10⁹⁶(97-digit number)
10492084368501468990…74997268199096186799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.098 × 10⁹⁶(97-digit number)
20984168737002937981…49994536398192373599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.196 × 10⁹⁶(97-digit number)
41968337474005875963…99989072796384747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.393 × 10⁹⁶(97-digit number)
83936674948011751927…99978145592769494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.678 × 10⁹⁷(98-digit number)
16787334989602350385…99956291185538988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.357 × 10⁹⁷(98-digit number)
33574669979204700771…99912582371077977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.714 × 10⁹⁷(98-digit number)
67149339958409401542…99825164742155955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.342 × 10⁹⁸(99-digit number)
13429867991681880308…99650329484311910399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.685 × 10⁹⁸(99-digit number)
26859735983363760616…99300658968623820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.371 × 10⁹⁸(99-digit number)
53719471966727521233…98601317937247641599
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,988,467 XPM·at block #6,843,013 · 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