Block #296,429

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2013, 12:30:21 AM · Difficulty 9.9917 · 6,510,219 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
25ca17a87b96d0961811aa0339c0493a84ef2d5fe03113b7ba200b8f1c362c72

Height

#296,429

Difficulty

9.991697

Transactions

1

Size

1.11 KB

Version

2

Bits

09fddfde

Nonce

81,287

Timestamp

12/6/2013, 12:30:21 AM

Confirmations

6,510,219

Merkle Root

40d8454a7b089ffba806792c0476bb3d77c78eaa7135e498227cf48e6cea75e5
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.

2.137 × 10⁹⁷(98-digit number)
21374208708871048714…74608931461960703999
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
2.137 × 10⁹⁷(98-digit number)
21374208708871048714…74608931461960703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.274 × 10⁹⁷(98-digit number)
42748417417742097428…49217862923921407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.549 × 10⁹⁷(98-digit number)
85496834835484194856…98435725847842815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.709 × 10⁹⁸(99-digit number)
17099366967096838971…96871451695685631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.419 × 10⁹⁸(99-digit number)
34198733934193677942…93742903391371263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.839 × 10⁹⁸(99-digit number)
68397467868387355884…87485806782742527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.367 × 10⁹⁹(100-digit number)
13679493573677471176…74971613565485055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.735 × 10⁹⁹(100-digit number)
27358987147354942353…49943227130970111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.471 × 10⁹⁹(100-digit number)
54717974294709884707…99886454261940223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.094 × 10¹⁰⁰(101-digit number)
10943594858941976941…99772908523880447999
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,279 XPM·at block #6,806,647 · 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