Block #296,651

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2013, 3:43:34 AM · Difficulty 9.9918 · 6,513,985 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3254d6d145b663ebeb5ca9c0c98045ed60606ed989b7ff3bdb6dcba4f1a9ea51

Height

#296,651

Difficulty

9.991766

Transactions

16

Size

5.75 KB

Version

2

Bits

09fde459

Nonce

4,506

Timestamp

12/6/2013, 3:43:34 AM

Confirmations

6,513,985

Merkle Root

8a7a61bf51771d4009d3ff2718f9d414a4df464d2fbac00528416f8478ee7538
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.637 × 10⁹⁴(95-digit number)
26376883684869841272…42444975540181753919
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.637 × 10⁹⁴(95-digit number)
26376883684869841272…42444975540181753919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.275 × 10⁹⁴(95-digit number)
52753767369739682544…84889951080363507839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.055 × 10⁹⁵(96-digit number)
10550753473947936508…69779902160727015679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.110 × 10⁹⁵(96-digit number)
21101506947895873017…39559804321454031359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.220 × 10⁹⁵(96-digit number)
42203013895791746035…79119608642908062719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.440 × 10⁹⁵(96-digit number)
84406027791583492071…58239217285816125439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.688 × 10⁹⁶(97-digit number)
16881205558316698414…16478434571632250879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.376 × 10⁹⁶(97-digit number)
33762411116633396828…32956869143264501759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.752 × 10⁹⁶(97-digit number)
67524822233266793657…65913738286529003519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.350 × 10⁹⁷(98-digit number)
13504964446653358731…31827476573058007039
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,729,176 XPM·at block #6,810,635 · 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