Block #269,401

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/23/2013, 2:45:02 AM · Difficulty 9.9533 · 6,539,764 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
22275674941eaa0d7efc5ddf13282ebead9e69ea685fda518cd8b2fb6428602b

Height

#269,401

Difficulty

9.953320

Transactions

6

Size

1.91 KB

Version

2

Bits

09f40cce

Nonce

47,938

Timestamp

11/23/2013, 2:45:02 AM

Confirmations

6,539,764

Merkle Root

5134e5b1799ae80c36fef9eeae3cb6b4acb24ecc5a6dce2521577d764f8b2746
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.

5.984 × 10¹⁰⁴(105-digit number)
59841703794867592544…40557685718958248959
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
5.984 × 10¹⁰⁴(105-digit number)
59841703794867592544…40557685718958248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.196 × 10¹⁰⁵(106-digit number)
11968340758973518508…81115371437916497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.393 × 10¹⁰⁵(106-digit number)
23936681517947037017…62230742875832995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.787 × 10¹⁰⁵(106-digit number)
47873363035894074035…24461485751665991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.574 × 10¹⁰⁵(106-digit number)
95746726071788148070…48922971503331983359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.914 × 10¹⁰⁶(107-digit number)
19149345214357629614…97845943006663966719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.829 × 10¹⁰⁶(107-digit number)
38298690428715259228…95691886013327933439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.659 × 10¹⁰⁶(107-digit number)
76597380857430518456…91383772026655866879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.531 × 10¹⁰⁷(108-digit number)
15319476171486103691…82767544053311733759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.063 × 10¹⁰⁷(108-digit number)
30638952342972207382…65535088106623467519
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,717,381 XPM·at block #6,809,164 · 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