Block #311,861

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 6:26:23 PM · Difficulty 9.9956 · 6,512,792 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42703dd9ab4a28d421fa91e33ca521f69ecf9d65b02da56fccd97b33c3775c04

Height

#311,861

Difficulty

9.995621

Transactions

10

Size

4.72 KB

Version

2

Bits

09fee102

Nonce

129,503

Timestamp

12/14/2013, 6:26:23 PM

Confirmations

6,512,792

Merkle Root

05a27f4e349c9f8ed15645b3c2317a613ac03d692d177460344d1a99d4290b57
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.

4.069 × 10⁹⁵(96-digit number)
40695894867958673797…66718232596221911039
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
4.069 × 10⁹⁵(96-digit number)
40695894867958673797…66718232596221911039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.139 × 10⁹⁵(96-digit number)
81391789735917347595…33436465192443822079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.627 × 10⁹⁶(97-digit number)
16278357947183469519…66872930384887644159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.255 × 10⁹⁶(97-digit number)
32556715894366939038…33745860769775288319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.511 × 10⁹⁶(97-digit number)
65113431788733878076…67491721539550576639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.302 × 10⁹⁷(98-digit number)
13022686357746775615…34983443079101153279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.604 × 10⁹⁷(98-digit number)
26045372715493551230…69966886158202306559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.209 × 10⁹⁷(98-digit number)
52090745430987102461…39933772316404613119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.041 × 10⁹⁸(99-digit number)
10418149086197420492…79867544632809226239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.083 × 10⁹⁸(99-digit number)
20836298172394840984…59735089265618452479
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,841,288 XPM·at block #6,824,652 · 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