Block #266,614

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/20/2013, 2:06:41 PM · Difficulty 9.9605 · 6,541,758 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e8e1cf2fab5ad838cc49efbf649bc6f72f1920ff6ce61cc649c920a26bbd0915

Height

#266,614

Difficulty

9.960461

Transactions

1

Size

1.91 KB

Version

2

Bits

09f5e0c3

Nonce

28,617

Timestamp

11/20/2013, 2:06:41 PM

Confirmations

6,541,758

Merkle Root

5ed5be57647af120990cc6e592a14e8d92369597f6e3f066fecde02392429f8d
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.551 × 10⁹⁹(100-digit number)
25516295074849975080…41310490695954047999
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.551 × 10⁹⁹(100-digit number)
25516295074849975080…41310490695954047999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.103 × 10⁹⁹(100-digit number)
51032590149699950161…82620981391908095999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.020 × 10¹⁰⁰(101-digit number)
10206518029939990032…65241962783816191999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.041 × 10¹⁰⁰(101-digit number)
20413036059879980064…30483925567632383999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.082 × 10¹⁰⁰(101-digit number)
40826072119759960129…60967851135264767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.165 × 10¹⁰⁰(101-digit number)
81652144239519920258…21935702270529535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.633 × 10¹⁰¹(102-digit number)
16330428847903984051…43871404541059071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.266 × 10¹⁰¹(102-digit number)
32660857695807968103…87742809082118143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.532 × 10¹⁰¹(102-digit number)
65321715391615936206…75485618164236287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.306 × 10¹⁰²(103-digit number)
13064343078323187241…50971236328472575999
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,711,030 XPM·at block #6,808,371 · 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