Block #306,632

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2013, 3:54:32 AM · Difficulty 9.9939 · 6,499,749 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1dce882fa26567fc43233d6eb25aa3801bee308fc5582f62ef830ebdd467eb4d

Height

#306,632

Difficulty

9.993941

Transactions

20

Size

7.93 KB

Version

2

Bits

09fe72e4

Nonce

57,201

Timestamp

12/12/2013, 3:54:32 AM

Confirmations

6,499,749

Merkle Root

a2fcfbce758aad95fa7d85c91e325112db60ef60814c1006de38a5dec588f853
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.425 × 10⁹²(93-digit number)
14255141982471702363…46917434831969787281
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.425 × 10⁹²(93-digit number)
14255141982471702363…46917434831969787281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.851 × 10⁹²(93-digit number)
28510283964943404727…93834869663939574561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.702 × 10⁹²(93-digit number)
57020567929886809455…87669739327879149121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.140 × 10⁹³(94-digit number)
11404113585977361891…75339478655758298241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.280 × 10⁹³(94-digit number)
22808227171954723782…50678957311516596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.561 × 10⁹³(94-digit number)
45616454343909447564…01357914623033192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.123 × 10⁹³(94-digit number)
91232908687818895128…02715829246066385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.824 × 10⁹⁴(95-digit number)
18246581737563779025…05431658492132771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.649 × 10⁹⁴(95-digit number)
36493163475127558051…10863316984265543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.298 × 10⁹⁴(95-digit number)
72986326950255116102…21726633968531087361
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,695,137 XPM·at block #6,806,380 · 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