Block #245,407

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/5/2013, 10:56:57 AM · Difficulty 9.9639 · 6,585,139 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
16ebc5e3e5c3d2f43628e962ea1b2164222b3b1727b5c4f4fad8028559779547

Height

#245,407

Difficulty

9.963879

Transactions

1

Size

1.24 KB

Version

2

Bits

09f6c0bf

Nonce

14,851

Timestamp

11/5/2013, 10:56:57 AM

Confirmations

6,585,139

Merkle Root

7a959807cd5063c40543bc65bf197b762383e26500385a4ff5cfe93abe6bd032
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.110 × 10⁸⁹(90-digit number)
11103444031264340534…10991146646609963641
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.110 × 10⁸⁹(90-digit number)
11103444031264340534…10991146646609963641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.220 × 10⁸⁹(90-digit number)
22206888062528681068…21982293293219927281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.441 × 10⁸⁹(90-digit number)
44413776125057362136…43964586586439854561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.882 × 10⁸⁹(90-digit number)
88827552250114724273…87929173172879709121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.776 × 10⁹⁰(91-digit number)
17765510450022944854…75858346345759418241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.553 × 10⁹⁰(91-digit number)
35531020900045889709…51716692691518836481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.106 × 10⁹⁰(91-digit number)
71062041800091779418…03433385383037672961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.421 × 10⁹¹(92-digit number)
14212408360018355883…06866770766075345921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.842 × 10⁹¹(92-digit number)
28424816720036711767…13733541532150691841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.684 × 10⁹¹(92-digit number)
56849633440073423534…27467083064301383681
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,888,617 XPM·at block #6,830,545 · 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.
Privacy Policy·

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