Block #310,986

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 8:26:11 AM · Difficulty 9.9953 · 6,497,483 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d0bfd87103898203bad99742741e868883d9ee736f922050cdc9b4f5fc3142de

Height

#310,986

Difficulty

9.995345

Transactions

4

Size

3.09 KB

Version

2

Bits

09fecef0

Nonce

198,668

Timestamp

12/14/2013, 8:26:11 AM

Confirmations

6,497,483

Merkle Root

843d5ee11ffdec0be2c1441b8b60a38ce714210b170204daeca47af127f026eb
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.734 × 10⁹⁸(99-digit number)
57343757181255284522…75903870002605331201
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.734 × 10⁹⁸(99-digit number)
57343757181255284522…75903870002605331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.146 × 10⁹⁹(100-digit number)
11468751436251056904…51807740005210662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.293 × 10⁹⁹(100-digit number)
22937502872502113809…03615480010421324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.587 × 10⁹⁹(100-digit number)
45875005745004227618…07230960020842649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.175 × 10⁹⁹(100-digit number)
91750011490008455236…14461920041685299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.835 × 10¹⁰⁰(101-digit number)
18350002298001691047…28923840083370598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.670 × 10¹⁰⁰(101-digit number)
36700004596003382094…57847680166741196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.340 × 10¹⁰⁰(101-digit number)
73400009192006764189…15695360333482393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.468 × 10¹⁰¹(102-digit number)
14680001838401352837…31390720666964787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.936 × 10¹⁰¹(102-digit number)
29360003676802705675…62781441333929574401
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,711,807 XPM·at block #6,808,468 · 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