Block #395,495

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/8/2014, 6:36:29 PM · Difficulty 10.4100 · 6,413,325 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ac0f8ee12f6d456641ac6bef1666584d18b957d27ff2e115155a2630c25dad5

Height

#395,495

Difficulty

10.409955

Transactions

4

Size

1.39 KB

Version

2

Bits

0a68f2d5

Nonce

100,271

Timestamp

2/8/2014, 6:36:29 PM

Confirmations

6,413,325

Merkle Root

7adc3a6d4f51f89c70880bae80fe862ad481a0fc27e4220569724b5fa15839b7
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.484 × 10⁹⁸(99-digit number)
24849670811225102370…39653042159646826239
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.484 × 10⁹⁸(99-digit number)
24849670811225102370…39653042159646826239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.969 × 10⁹⁸(99-digit number)
49699341622450204741…79306084319293652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.939 × 10⁹⁸(99-digit number)
99398683244900409483…58612168638587304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.987 × 10⁹⁹(100-digit number)
19879736648980081896…17224337277174609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.975 × 10⁹⁹(100-digit number)
39759473297960163793…34448674554349219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.951 × 10⁹⁹(100-digit number)
79518946595920327586…68897349108698439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.590 × 10¹⁰⁰(101-digit number)
15903789319184065517…37794698217396879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.180 × 10¹⁰⁰(101-digit number)
31807578638368131034…75589396434793758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.361 × 10¹⁰⁰(101-digit number)
63615157276736262069…51178792869587517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.272 × 10¹⁰¹(102-digit number)
12723031455347252413…02357585739175034879
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,714,617 XPM·at block #6,808,819 · 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