Block #397,164

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/9/2014, 9:42:57 PM · Difficulty 10.4152 · 6,420,070 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf6836cc27f0c57a1b5e5b92b30de855047b5b30789aa94881f83edef2aaae3a

Height

#397,164

Difficulty

10.415212

Transactions

2

Size

418 B

Version

2

Bits

0a6a4b58

Nonce

21,919

Timestamp

2/9/2014, 9:42:57 PM

Confirmations

6,420,070

Merkle Root

255a404d57218cb60d5ac9f06455714c15ace4b52527fe508c32a2512dd72a45
Transactions (2)
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.061 × 10¹⁰⁷(108-digit number)
10616604038054976917…69188549019398949679
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.061 × 10¹⁰⁷(108-digit number)
10616604038054976917…69188549019398949679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.123 × 10¹⁰⁷(108-digit number)
21233208076109953834…38377098038797899359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.246 × 10¹⁰⁷(108-digit number)
42466416152219907668…76754196077595798719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.493 × 10¹⁰⁷(108-digit number)
84932832304439815336…53508392155191597439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.698 × 10¹⁰⁸(109-digit number)
16986566460887963067…07016784310383194879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.397 × 10¹⁰⁸(109-digit number)
33973132921775926134…14033568620766389759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.794 × 10¹⁰⁸(109-digit number)
67946265843551852269…28067137241532779519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.358 × 10¹⁰⁹(110-digit number)
13589253168710370453…56134274483065559039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.717 × 10¹⁰⁹(110-digit number)
27178506337420740907…12268548966131118079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.435 × 10¹⁰⁹(110-digit number)
54357012674841481815…24537097932262236159
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,781,911 XPM·at block #6,817,233 · 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