Block #409,995

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/18/2014, 6:05:52 PM · Difficulty 10.4311 · 6,407,364 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e1b4c1db32d928e958a075aaa14a9d4947493b7f0092cbaeeb87230393b4a6df

Height

#409,995

Difficulty

10.431056

Transactions

2

Size

542 B

Version

2

Bits

0a6e59b3

Nonce

478,869

Timestamp

2/18/2014, 6:05:52 PM

Confirmations

6,407,364

Merkle Root

f3ab1a944c5e4da129e326b39073c18e30b89b846373cbabb6dc86da0d108d8c
Transactions (2)
1 in → 1 out9.1900 XPM110 B
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.390 × 10¹⁰⁰(101-digit number)
13907464631927002771…46148723043134655999
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.390 × 10¹⁰⁰(101-digit number)
13907464631927002771…46148723043134655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.781 × 10¹⁰⁰(101-digit number)
27814929263854005542…92297446086269311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.562 × 10¹⁰⁰(101-digit number)
55629858527708011084…84594892172538623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.112 × 10¹⁰¹(102-digit number)
11125971705541602216…69189784345077247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.225 × 10¹⁰¹(102-digit number)
22251943411083204433…38379568690154495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.450 × 10¹⁰¹(102-digit number)
44503886822166408867…76759137380308991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.900 × 10¹⁰¹(102-digit number)
89007773644332817735…53518274760617983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.780 × 10¹⁰²(103-digit number)
17801554728866563547…07036549521235967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.560 × 10¹⁰²(103-digit number)
35603109457733127094…14073099042471935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.120 × 10¹⁰²(103-digit number)
71206218915466254188…28146198084943871999
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,782,920 XPM·at block #6,817,358 · 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