Block #291,426

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2013, 4:33:12 AM · Difficulty 9.9898 · 6,525,786 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1d0782a317046fe8d11a4cdbb7540cfdb99bcddd9bc841d0c847b1e527f7b6ce

Height

#291,426

Difficulty

9.989841

Transactions

8

Size

2.72 KB

Version

2

Bits

09fd663d

Nonce

22,148

Timestamp

12/3/2013, 4:33:12 AM

Confirmations

6,525,786

Merkle Root

4cc866ea17ecf0c30878890d1a32559b4cd65b344fddc3b1805b5ca18918c2f6
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.152 × 10⁹²(93-digit number)
11527139221630566346…09171170186336437441
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.152 × 10⁹²(93-digit number)
11527139221630566346…09171170186336437441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.305 × 10⁹²(93-digit number)
23054278443261132693…18342340372672874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.610 × 10⁹²(93-digit number)
46108556886522265387…36684680745345749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.221 × 10⁹²(93-digit number)
92217113773044530775…73369361490691499521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.844 × 10⁹³(94-digit number)
18443422754608906155…46738722981382999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.688 × 10⁹³(94-digit number)
36886845509217812310…93477445962765998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.377 × 10⁹³(94-digit number)
73773691018435624620…86954891925531996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.475 × 10⁹⁴(95-digit number)
14754738203687124924…73909783851063992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.950 × 10⁹⁴(95-digit number)
29509476407374249848…47819567702127984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.901 × 10⁹⁴(95-digit number)
59018952814748499696…95639135404255969281
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,781,735 XPM·at block #6,817,211 · 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