Block #387,481

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/3/2014, 4:18:27 AM · Difficulty 10.4124 · 6,422,087 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6d30bc3e0fe8709cd9732455af5a8529086e9d8459c4a2a4b49cc299cae870bb

Height

#387,481

Difficulty

10.412375

Transactions

5

Size

1.08 KB

Version

2

Bits

0a699165

Nonce

256,588

Timestamp

2/3/2014, 4:18:27 AM

Confirmations

6,422,087

Merkle Root

1ca21cd4f5ab44012895470a23e36fab8b7b7ae4543593a9c8ba24913d3e99bd
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.

2.675 × 10⁹⁸(99-digit number)
26751758655930788174…22687197010683320319
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
2.675 × 10⁹⁸(99-digit number)
26751758655930788174…22687197010683320319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.350 × 10⁹⁸(99-digit number)
53503517311861576348…45374394021366640639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.070 × 10⁹⁹(100-digit number)
10700703462372315269…90748788042733281279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.140 × 10⁹⁹(100-digit number)
21401406924744630539…81497576085466562559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.280 × 10⁹⁹(100-digit number)
42802813849489261079…62995152170933125119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.560 × 10⁹⁹(100-digit number)
85605627698978522158…25990304341866250239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.712 × 10¹⁰⁰(101-digit number)
17121125539795704431…51980608683732500479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.424 × 10¹⁰⁰(101-digit number)
34242251079591408863…03961217367465000959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.848 × 10¹⁰⁰(101-digit number)
68484502159182817726…07922434734930001919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.369 × 10¹⁰¹(102-digit number)
13696900431836563545…15844869469860003839
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,720,620 XPM·at block #6,809,567 · 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