Block #309,678

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 5:19:50 PM · Difficulty 9.9949 · 6,499,800 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e6d0c46ca6a3a66022f28036268005f3c7e332235a73a12b070036b2749aeed

Height

#309,678

Difficulty

9.994918

Transactions

8

Size

2.94 KB

Version

2

Bits

09feb2ec

Nonce

30,205

Timestamp

12/13/2013, 5:19:50 PM

Confirmations

6,499,800

Merkle Root

4675fbbab8d192c9aa34b0aa47ce30604a3db4432e4f485fe1ad99327a555f80
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.

2.829 × 10⁹²(93-digit number)
28290914819434625899…43928949523494830081
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
2.829 × 10⁹²(93-digit number)
28290914819434625899…43928949523494830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.658 × 10⁹²(93-digit number)
56581829638869251798…87857899046989660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.131 × 10⁹³(94-digit number)
11316365927773850359…75715798093979320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.263 × 10⁹³(94-digit number)
22632731855547700719…51431596187958640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.526 × 10⁹³(94-digit number)
45265463711095401439…02863192375917281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.053 × 10⁹³(94-digit number)
90530927422190802878…05726384751834562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.810 × 10⁹⁴(95-digit number)
18106185484438160575…11452769503669125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.621 × 10⁹⁴(95-digit number)
36212370968876321151…22905539007338250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.242 × 10⁹⁴(95-digit number)
72424741937752642302…45811078014676500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.448 × 10⁹⁵(96-digit number)
14484948387550528460…91622156029353000961
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,897 XPM·at block #6,809,477 · 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