Block #311,958

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 7:30:14 PM · Difficulty 9.9957 · 6,498,893 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e95651b3bf452890c59209cf4f65605686d935d7125eddb9e8cce99c5a87df3a

Height

#311,958

Difficulty

9.995653

Transactions

7

Size

1.78 KB

Version

2

Bits

09fee324

Nonce

175,195

Timestamp

12/14/2013, 7:30:14 PM

Confirmations

6,498,893

Merkle Root

ed54b67ee4fe5c321e13b0234c25605be591ed891ebd77c81f8e464139bcfe2c
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.

3.109 × 10⁹⁴(95-digit number)
31090430279212149483…00156903399050257599
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
3.109 × 10⁹⁴(95-digit number)
31090430279212149483…00156903399050257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.218 × 10⁹⁴(95-digit number)
62180860558424298967…00313806798100515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.243 × 10⁹⁵(96-digit number)
12436172111684859793…00627613596201030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.487 × 10⁹⁵(96-digit number)
24872344223369719586…01255227192402060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.974 × 10⁹⁵(96-digit number)
49744688446739439173…02510454384804121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.948 × 10⁹⁵(96-digit number)
99489376893478878347…05020908769608243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.989 × 10⁹⁶(97-digit number)
19897875378695775669…10041817539216486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.979 × 10⁹⁶(97-digit number)
39795750757391551338…20083635078432972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.959 × 10⁹⁶(97-digit number)
79591501514783102677…40167270156865945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.591 × 10⁹⁷(98-digit number)
15918300302956620535…80334540313731891199
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,730,904 XPM·at block #6,810,850 · 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