Block #318,149

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 4:24:07 AM · Difficulty 10.1563 · 6,490,285 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e21ed5ff1817899cbb8b10e8bf18635c60ff87727859de8cb0e0161216e0ef72

Height

#318,149

Difficulty

10.156278

Transactions

14

Size

3.44 KB

Version

2

Bits

0a2801dd

Nonce

15,150

Timestamp

12/18/2013, 4:24:07 AM

Confirmations

6,490,285

Merkle Root

1adb2a733da002b5207300778d6ad958bdafa8985d9f271bb0c313afaf3f8bb4
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.429 × 10⁹⁸(99-digit number)
44299829817982119916…03781965040008923239
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.429 × 10⁹⁸(99-digit number)
44299829817982119916…03781965040008923239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.859 × 10⁹⁸(99-digit number)
88599659635964239833…07563930080017846479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.771 × 10⁹⁹(100-digit number)
17719931927192847966…15127860160035692959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.543 × 10⁹⁹(100-digit number)
35439863854385695933…30255720320071385919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.087 × 10⁹⁹(100-digit number)
70879727708771391866…60511440640142771839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.417 × 10¹⁰⁰(101-digit number)
14175945541754278373…21022881280285543679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.835 × 10¹⁰⁰(101-digit number)
28351891083508556746…42045762560571087359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.670 × 10¹⁰⁰(101-digit number)
56703782167017113493…84091525121142174719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.134 × 10¹⁰¹(102-digit number)
11340756433403422698…68183050242284349439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.268 × 10¹⁰¹(102-digit number)
22681512866806845397…36366100484568698879
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,711,533 XPM·at block #6,808,433 · 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