Block #288,006

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 1:41:20 PM · Difficulty 9.9873 · 6,521,462 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ecdda6f744315f907141e758bb00ddcc8878af8e2dcb3ea83c251087f84a2ab3

Height

#288,006

Difficulty

9.987262

Transactions

4

Size

2.62 KB

Version

2

Bits

09fcbd31

Nonce

15,499

Timestamp

12/1/2013, 1:41:20 PM

Confirmations

6,521,462

Merkle Root

f45db13658af89251dae4de5725fcfd73af621ebf8108576d5226c4a03c66365
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.169 × 10⁹⁹(100-digit number)
11698859072494958472…93458600678864816241
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.169 × 10⁹⁹(100-digit number)
11698859072494958472…93458600678864816241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.339 × 10⁹⁹(100-digit number)
23397718144989916944…86917201357729632481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.679 × 10⁹⁹(100-digit number)
46795436289979833888…73834402715459264961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.359 × 10⁹⁹(100-digit number)
93590872579959667777…47668805430918529921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.871 × 10¹⁰⁰(101-digit number)
18718174515991933555…95337610861837059841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.743 × 10¹⁰⁰(101-digit number)
37436349031983867111…90675221723674119681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.487 × 10¹⁰⁰(101-digit number)
74872698063967734222…81350443447348239361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.497 × 10¹⁰¹(102-digit number)
14974539612793546844…62700886894696478721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.994 × 10¹⁰¹(102-digit number)
29949079225587093688…25401773789392957441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.989 × 10¹⁰¹(102-digit number)
59898158451174187377…50803547578785914881
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,719,815 XPM·at block #6,809,467 · 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