Block #318,031

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 2:35:35 AM · Difficulty 10.1547 · 6,508,855 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
903332b2417acb50c53d2cd99a33cf144955f31b2bd6c37bb8c75d1aba66d457

Height

#318,031

Difficulty

10.154677

Transactions

1

Size

970 B

Version

2

Bits

0a2798f1

Nonce

52,414

Timestamp

12/18/2013, 2:35:35 AM

Confirmations

6,508,855

Merkle Root

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

1.048 × 10⁹⁸(99-digit number)
10486505949521941133…29191893636395400009
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
1.048 × 10⁹⁸(99-digit number)
10486505949521941133…29191893636395400009
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.097 × 10⁹⁸(99-digit number)
20973011899043882267…58383787272790800019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.194 × 10⁹⁸(99-digit number)
41946023798087764535…16767574545581600039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.389 × 10⁹⁸(99-digit number)
83892047596175529070…33535149091163200079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.677 × 10⁹⁹(100-digit number)
16778409519235105814…67070298182326400159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.355 × 10⁹⁹(100-digit number)
33556819038470211628…34140596364652800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.711 × 10⁹⁹(100-digit number)
67113638076940423256…68281192729305600639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.342 × 10¹⁰⁰(101-digit number)
13422727615388084651…36562385458611201279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.684 × 10¹⁰⁰(101-digit number)
26845455230776169302…73124770917222402559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.369 × 10¹⁰⁰(101-digit number)
53690910461552338604…46249541834444805119
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,859,253 XPM·at block #6,826,885 · 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