Block #397,107

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/9/2014, 8:34:19 PM · Difficulty 10.4166 · 6,409,203 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
887e8f14aa2e6bac65358d8ee7ede35dbdd52d1f3c5276d57a02b808f13c0a74

Height

#397,107

Difficulty

10.416555

Transactions

3

Size

1.55 KB

Version

2

Bits

0a6aa35e

Nonce

129,726

Timestamp

2/9/2014, 8:34:19 PM

Confirmations

6,409,203

Merkle Root

8f5ca3e69514c96fe13ecc23d11d9d717dd7a2e64551b2972331382c1899c691
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.490 × 10⁹⁹(100-digit number)
14901321898390679611…96152417316554630399
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.490 × 10⁹⁹(100-digit number)
14901321898390679611…96152417316554630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.980 × 10⁹⁹(100-digit number)
29802643796781359223…92304834633109260799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.960 × 10⁹⁹(100-digit number)
59605287593562718447…84609669266218521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.192 × 10¹⁰⁰(101-digit number)
11921057518712543689…69219338532437043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.384 × 10¹⁰⁰(101-digit number)
23842115037425087378…38438677064874086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.768 × 10¹⁰⁰(101-digit number)
47684230074850174757…76877354129748172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.536 × 10¹⁰⁰(101-digit number)
95368460149700349515…53754708259496345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.907 × 10¹⁰¹(102-digit number)
19073692029940069903…07509416518992691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.814 × 10¹⁰¹(102-digit number)
38147384059880139806…15018833037985382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.629 × 10¹⁰¹(102-digit number)
76294768119760279612…30037666075970764799
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,694,568 XPM·at block #6,806,309 · 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