Block #387,746

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/3/2014, 8:18:13 AM · Difficulty 10.4150 · 6,422,482 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ed00f4f1849a2e255898dfc326eaa658bb2e60cd7ffffa08d061c064e8eafb3f

Height

#387,746

Difficulty

10.415003

Transactions

8

Size

3.67 KB

Version

2

Bits

0a6a3dab

Nonce

154,270

Timestamp

2/3/2014, 8:18:13 AM

Confirmations

6,422,482

Merkle Root

9725541fad30841e0a8af346ed9e548ea20a3025df76082b73998d1f3ae9b61d
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.511 × 10¹⁰¹(102-digit number)
25110069101276790553…29367337985241235679
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.511 × 10¹⁰¹(102-digit number)
25110069101276790553…29367337985241235679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.022 × 10¹⁰¹(102-digit number)
50220138202553581106…58734675970482471359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.004 × 10¹⁰²(103-digit number)
10044027640510716221…17469351940964942719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.008 × 10¹⁰²(103-digit number)
20088055281021432442…34938703881929885439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.017 × 10¹⁰²(103-digit number)
40176110562042864885…69877407763859770879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.035 × 10¹⁰²(103-digit number)
80352221124085729770…39754815527719541759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.607 × 10¹⁰³(104-digit number)
16070444224817145954…79509631055439083519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.214 × 10¹⁰³(104-digit number)
32140888449634291908…59019262110878167039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.428 × 10¹⁰³(104-digit number)
64281776899268583816…18038524221756334079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.285 × 10¹⁰⁴(105-digit number)
12856355379853716763…36077048443512668159
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,725,901 XPM·at block #6,810,227 · 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