Block #312,028

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 8:14:14 PM · Difficulty 9.9957 · 6,514,896 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
685d1ba16500ac7b74e0bdc8521868559416c7988cfcb9ec658df45cc556c78f

Height

#312,028

Difficulty

9.995678

Transactions

19

Size

4.13 KB

Version

2

Bits

09fee4be

Nonce

152,995

Timestamp

12/14/2013, 8:14:14 PM

Confirmations

6,514,896

Merkle Root

53e8ca492eb499dc63c4e87b8c2460272bc9088ce057ae9396266bc2bea7d0b0
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.212 × 10⁹⁴(95-digit number)
12123177510285834371…36753902712495153201
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.212 × 10⁹⁴(95-digit number)
12123177510285834371…36753902712495153201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.424 × 10⁹⁴(95-digit number)
24246355020571668742…73507805424990306401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.849 × 10⁹⁴(95-digit number)
48492710041143337485…47015610849980612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.698 × 10⁹⁴(95-digit number)
96985420082286674971…94031221699961225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.939 × 10⁹⁵(96-digit number)
19397084016457334994…88062443399922451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.879 × 10⁹⁵(96-digit number)
38794168032914669988…76124886799844902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.758 × 10⁹⁵(96-digit number)
77588336065829339977…52249773599689804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.551 × 10⁹⁶(97-digit number)
15517667213165867995…04499547199379609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.103 × 10⁹⁶(97-digit number)
31035334426331735990…08999094398759219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.207 × 10⁹⁶(97-digit number)
62070668852663471981…17998188797518438401
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,859,563 XPM·at block #6,826,923 · 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