Block #311,096

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 9:47:11 AM · Difficulty 9.9954 · 6,503,120 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f33f5181cc7bc5043f3b1057f0c9ff11e1c68f36cc72d001afce1c8cd2e3feb8

Height

#311,096

Difficulty

9.995375

Transactions

4

Size

2.88 KB

Version

2

Bits

09fed0ec

Nonce

213,932

Timestamp

12/14/2013, 9:47:11 AM

Confirmations

6,503,120

Merkle Root

105a18a6e2c9cf57cba5e90d451a267d6a807d848ec6a9694c8a42cb98c4c674
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.851 × 10⁹⁴(95-digit number)
28517770341569499787…36213332418349957119
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.851 × 10⁹⁴(95-digit number)
28517770341569499787…36213332418349957119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.703 × 10⁹⁴(95-digit number)
57035540683138999575…72426664836699914239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.140 × 10⁹⁵(96-digit number)
11407108136627799915…44853329673399828479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.281 × 10⁹⁵(96-digit number)
22814216273255599830…89706659346799656959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.562 × 10⁹⁵(96-digit number)
45628432546511199660…79413318693599313919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.125 × 10⁹⁵(96-digit number)
91256865093022399320…58826637387198627839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.825 × 10⁹⁶(97-digit number)
18251373018604479864…17653274774397255679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.650 × 10⁹⁶(97-digit number)
36502746037208959728…35306549548794511359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.300 × 10⁹⁶(97-digit number)
73005492074417919456…70613099097589022719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.460 × 10⁹⁷(98-digit number)
14601098414883583891…41226198195178045439
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,757,796 XPM·at block #6,814,215 · 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