Block #290,544

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2013, 6:12:29 PM · Difficulty 9.9893 · 6,521,867 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f4d60a8173792f9ed2cca92cd527aadfc676429bd799e22a68d89fcd5ab81a5e

Height

#290,544

Difficulty

9.989271

Transactions

3

Size

1.36 KB

Version

2

Bits

09fd40e1

Nonce

4,404

Timestamp

12/2/2013, 6:12:29 PM

Confirmations

6,521,867

Merkle Root

81ff9c210e84b0bb81d7f07d5de8f5b014e134863ea6183677c97f42304e2bef
Transactions (3)
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.373 × 10¹⁰⁵(106-digit number)
13732275021316041396…74031510996694087679
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.373 × 10¹⁰⁵(106-digit number)
13732275021316041396…74031510996694087679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.746 × 10¹⁰⁵(106-digit number)
27464550042632082792…48063021993388175359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.492 × 10¹⁰⁵(106-digit number)
54929100085264165585…96126043986776350719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.098 × 10¹⁰⁶(107-digit number)
10985820017052833117…92252087973552701439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.197 × 10¹⁰⁶(107-digit number)
21971640034105666234…84504175947105402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.394 × 10¹⁰⁶(107-digit number)
43943280068211332468…69008351894210805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.788 × 10¹⁰⁶(107-digit number)
87886560136422664936…38016703788421611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.757 × 10¹⁰⁷(108-digit number)
17577312027284532987…76033407576843223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.515 × 10¹⁰⁷(108-digit number)
35154624054569065974…52066815153686446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.030 × 10¹⁰⁷(108-digit number)
70309248109138131949…04133630307372892159
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,743,315 XPM·at block #6,812,410 · 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