Block #289,465

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 5:24:27 AM · Difficulty 9.9886 · 6,528,308 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ea3effea1f9710dfe5f0029b39dd88f995cf5b17f7f8fd14ee27232f1701ad7

Height

#289,465

Difficulty

9.988551

Transactions

10

Size

2.90 KB

Version

2

Bits

09fd11a7

Nonce

84,804

Timestamp

12/2/2013, 5:24:27 AM

Confirmations

6,528,308

Merkle Root

fb88458edbfbba12f55c0898c4e0eb41b8c020ada0b8abcb6f2d17138eeca6b5
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.674 × 10⁹⁵(96-digit number)
16745498988545336078…19268964172623518801
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.674 × 10⁹⁵(96-digit number)
16745498988545336078…19268964172623518801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.349 × 10⁹⁵(96-digit number)
33490997977090672156…38537928345247037601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.698 × 10⁹⁵(96-digit number)
66981995954181344312…77075856690494075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.339 × 10⁹⁶(97-digit number)
13396399190836268862…54151713380988150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.679 × 10⁹⁶(97-digit number)
26792798381672537724…08303426761976300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.358 × 10⁹⁶(97-digit number)
53585596763345075449…16606853523952601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.071 × 10⁹⁷(98-digit number)
10717119352669015089…33213707047905203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.143 × 10⁹⁷(98-digit number)
21434238705338030179…66427414095810406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.286 × 10⁹⁷(98-digit number)
42868477410676060359…32854828191620812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.573 × 10⁹⁷(98-digit number)
85736954821352120719…65709656383241625601
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,786,241 XPM·at block #6,817,772 · 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