Block #315,244

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 10:07:28 AM · Difficulty 10.0914 · 6,497,805 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7db6de4c63959fe846680a3706d42437288bde0c24a5ba3fd984f586dfc9f71d

Height

#315,244

Difficulty

10.091442

Transactions

16

Size

5.29 KB

Version

2

Bits

0a1768be

Nonce

61,695

Timestamp

12/16/2013, 10:07:28 AM

Confirmations

6,497,805

Merkle Root

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

5.938 × 10⁹⁸(99-digit number)
59382503932156018941…74494675800007121919
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
5.938 × 10⁹⁸(99-digit number)
59382503932156018941…74494675800007121919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.187 × 10⁹⁹(100-digit number)
11876500786431203788…48989351600014243839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.375 × 10⁹⁹(100-digit number)
23753001572862407576…97978703200028487679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.750 × 10⁹⁹(100-digit number)
47506003145724815153…95957406400056975359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.501 × 10⁹⁹(100-digit number)
95012006291449630306…91914812800113950719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.900 × 10¹⁰⁰(101-digit number)
19002401258289926061…83829625600227901439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.800 × 10¹⁰⁰(101-digit number)
38004802516579852122…67659251200455802879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.600 × 10¹⁰⁰(101-digit number)
76009605033159704245…35318502400911605759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.520 × 10¹⁰¹(102-digit number)
15201921006631940849…70637004801823211519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.040 × 10¹⁰¹(102-digit number)
30403842013263881698…41274009603646423039
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,748,437 XPM·at block #6,813,048 · 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