Block #306,886

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2013, 7:31:31 AM · Difficulty 9.9940 · 6,509,541 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
207509f434c161ae828a49d0e8e52a06241c7c1cba418638ab5a708edd745969

Height

#306,886

Difficulty

9.993995

Transactions

14

Size

20.40 KB

Version

2

Bits

09fe7675

Nonce

279,303

Timestamp

12/12/2013, 7:31:31 AM

Confirmations

6,509,541

Merkle Root

9950e3900eac6c65e5591d6b0a41b9fafeb157eadb7778855d9c04af8903293c
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.236 × 10⁹⁴(95-digit number)
52366854624258974594…64100973042537139201
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.236 × 10⁹⁴(95-digit number)
52366854624258974594…64100973042537139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.047 × 10⁹⁵(96-digit number)
10473370924851794918…28201946085074278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.094 × 10⁹⁵(96-digit number)
20946741849703589837…56403892170148556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.189 × 10⁹⁵(96-digit number)
41893483699407179675…12807784340297113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.378 × 10⁹⁵(96-digit number)
83786967398814359351…25615568680594227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.675 × 10⁹⁶(97-digit number)
16757393479762871870…51231137361188454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.351 × 10⁹⁶(97-digit number)
33514786959525743740…02462274722376908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.702 × 10⁹⁶(97-digit number)
67029573919051487481…04924549444753817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.340 × 10⁹⁷(98-digit number)
13405914783810297496…09849098889507635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.681 × 10⁹⁷(98-digit number)
26811829567620594992…19698197779015270401
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,775,542 XPM·at block #6,816,426 · 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