Block #315,812

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 5:19:56 PM · Difficulty 10.1156 · 6,498,286 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8966c01789dee5fc4d87b6792a2467f0cb67658951f9b4c89b9a646608c0db1c

Height

#315,812

Difficulty

10.115649

Transactions

1

Size

1.08 KB

Version

2

Bits

0a1d9b27

Nonce

34,226

Timestamp

12/16/2013, 5:19:56 PM

Confirmations

6,498,286

Merkle Root

4096cdf9fed6371037afcf9d12413d27a4747ab4c169b513253d117944da27f8
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.454 × 10⁹⁸(99-digit number)
34549030588090527834…29998742142729739519
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.454 × 10⁹⁸(99-digit number)
34549030588090527834…29998742142729739519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.909 × 10⁹⁸(99-digit number)
69098061176181055669…59997484285459479039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.381 × 10⁹⁹(100-digit number)
13819612235236211133…19994968570918958079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.763 × 10⁹⁹(100-digit number)
27639224470472422267…39989937141837916159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.527 × 10⁹⁹(100-digit number)
55278448940944844535…79979874283675832319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.105 × 10¹⁰⁰(101-digit number)
11055689788188968907…59959748567351664639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.211 × 10¹⁰⁰(101-digit number)
22111379576377937814…19919497134703329279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.422 × 10¹⁰⁰(101-digit number)
44222759152755875628…39838994269406658559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.844 × 10¹⁰⁰(101-digit number)
88445518305511751257…79677988538813317119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.768 × 10¹⁰¹(102-digit number)
17689103661102350251…59355977077626634239
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,756,866 XPM·at block #6,814,097 · 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