Block #305,727

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 4:07:17 PM · Difficulty 9.9937 · 6,521,382 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
14c629adc17c0f968412142509f10875c47864455ffa4a4fb07ecc147bde79fe

Height

#305,727

Difficulty

9.993663

Transactions

21

Size

5.64 KB

Version

2

Bits

09fe60b5

Nonce

15,391

Timestamp

12/11/2013, 4:07:17 PM

Confirmations

6,521,382

Merkle Root

3733c41c9a7cda47eb122386b36dbff258ae063fc899c56457197043a8dbfa61
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.

7.927 × 10⁹⁵(96-digit number)
79275156298169597063…61762395774379214401
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
7.927 × 10⁹⁵(96-digit number)
79275156298169597063…61762395774379214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.585 × 10⁹⁶(97-digit number)
15855031259633919412…23524791548758428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.171 × 10⁹⁶(97-digit number)
31710062519267838825…47049583097516857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.342 × 10⁹⁶(97-digit number)
63420125038535677650…94099166195033715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.268 × 10⁹⁷(98-digit number)
12684025007707135530…88198332390067430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.536 × 10⁹⁷(98-digit number)
25368050015414271060…76396664780134860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.073 × 10⁹⁷(98-digit number)
50736100030828542120…52793329560269721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.014 × 10⁹⁸(99-digit number)
10147220006165708424…05586659120539443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.029 × 10⁹⁸(99-digit number)
20294440012331416848…11173318241078886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.058 × 10⁹⁸(99-digit number)
40588880024662833696…22346636482157772801
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,861,051 XPM·at block #6,827,108 · 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