Block #307,336

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2013, 12:33:58 PM · Difficulty 9.9942 · 6,499,217 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a7ba0edee850f87b39a239aa8d858caf845836a76f95d616f6bba00392820db9

Height

#307,336

Difficulty

9.994181

Transactions

1

Size

1.18 KB

Version

2

Bits

09fe82a8

Nonce

2,394

Timestamp

12/12/2013, 12:33:58 PM

Confirmations

6,499,217

Merkle Root

987ff40618fc48af2c76ff52b2ad0f5d55539c67f59106fa7e179faa2b1345b6
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.700 × 10⁹⁴(95-digit number)
17001216874906914693…71263050406267049281
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.700 × 10⁹⁴(95-digit number)
17001216874906914693…71263050406267049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.400 × 10⁹⁴(95-digit number)
34002433749813829387…42526100812534098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.800 × 10⁹⁴(95-digit number)
68004867499627658775…85052201625068197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.360 × 10⁹⁵(96-digit number)
13600973499925531755…70104403250136394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.720 × 10⁹⁵(96-digit number)
27201946999851063510…40208806500272788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.440 × 10⁹⁵(96-digit number)
54403893999702127020…80417613000545576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.088 × 10⁹⁶(97-digit number)
10880778799940425404…60835226001091153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.176 × 10⁹⁶(97-digit number)
21761557599880850808…21670452002182307841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.352 × 10⁹⁶(97-digit number)
43523115199761701616…43340904004364615681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.704 × 10⁹⁶(97-digit number)
87046230399523403232…86681808008729231361
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,696,527 XPM·at block #6,806,552 · 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