Block #249,860

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/8/2013, 4:49:57 AM · Difficulty 9.9675 · 6,563,141 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8a539866e797b10e1349533ec75c809c2f8ccb26162253e5fa30e32b7c5f387d

Height

#249,860

Difficulty

9.967477

Transactions

1

Size

2.01 KB

Version

2

Bits

09f7ac8f

Nonce

10,083

Timestamp

11/8/2013, 4:49:57 AM

Confirmations

6,563,141

Merkle Root

47ce44aedc968dc334a1c4b736c9dfa8d3323c0b5d40641ac0ee0ccd41a41343
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.008 × 10⁹⁶(97-digit number)
10081490741909034401…74229144329248348799
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.008 × 10⁹⁶(97-digit number)
10081490741909034401…74229144329248348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.016 × 10⁹⁶(97-digit number)
20162981483818068802…48458288658496697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.032 × 10⁹⁶(97-digit number)
40325962967636137605…96916577316993395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.065 × 10⁹⁶(97-digit number)
80651925935272275211…93833154633986790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.613 × 10⁹⁷(98-digit number)
16130385187054455042…87666309267973580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.226 × 10⁹⁷(98-digit number)
32260770374108910084…75332618535947161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.452 × 10⁹⁷(98-digit number)
64521540748217820168…50665237071894323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.290 × 10⁹⁸(99-digit number)
12904308149643564033…01330474143788646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.580 × 10⁹⁸(99-digit number)
25808616299287128067…02660948287577292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.161 × 10⁹⁸(99-digit number)
51617232598574256135…05321896575154585599
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,748,048 XPM·at block #6,813,000 · 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