Block #406,187

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 2:17:44 AM · Difficulty 10.4315 · 6,420,774 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7d8d0e6559b2c0d0ef6f1f82eb2ef00a4a56d160a010ef43ca9f12359ba0e3f4

Height

#406,187

Difficulty

10.431524

Transactions

4

Size

886 B

Version

2

Bits

0a6e7859

Nonce

201,326,838

Timestamp

2/16/2014, 2:17:44 AM

Confirmations

6,420,774

Merkle Root

b5c6b535bfdf3aa76999f409c83a96759892a9d2fbf5d98cebd1f5e6dfc6bb5b
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.429 × 10⁹⁶(97-digit number)
34298350376689116255…91070273485427111679
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.429 × 10⁹⁶(97-digit number)
34298350376689116255…91070273485427111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.859 × 10⁹⁶(97-digit number)
68596700753378232511…82140546970854223359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.371 × 10⁹⁷(98-digit number)
13719340150675646502…64281093941708446719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.743 × 10⁹⁷(98-digit number)
27438680301351293004…28562187883416893439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.487 × 10⁹⁷(98-digit number)
54877360602702586009…57124375766833786879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.097 × 10⁹⁸(99-digit number)
10975472120540517201…14248751533667573759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.195 × 10⁹⁸(99-digit number)
21950944241081034403…28497503067335147519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.390 × 10⁹⁸(99-digit number)
43901888482162068807…56995006134670295039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.780 × 10⁹⁸(99-digit number)
87803776964324137614…13990012269340590079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.756 × 10⁹⁹(100-digit number)
17560755392864827522…27980024538681180159
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,859,864 XPM·at block #6,826,960 · 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