Block #1,407,829

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2016, 9:40:03 PM · Difficulty 10.8049 · 5,402,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec5cb4a2a4ecbb7c4ab4867098e7b53869e1c188679fa39331b4fef567e7e8b7

Height

#1,407,829

Difficulty

10.804919

Transactions

4

Size

2.73 KB

Version

2

Bits

0ace0f2c

Nonce

591,636,382

Timestamp

1/10/2016, 9:40:03 PM

Confirmations

5,402,541

Merkle Root

a06d42e0f04c72ce16e7e771f08b5737f17fa66c00cd74605cbf4a686f779a1d
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.937 × 10⁹⁶(97-digit number)
19370630230541868402…45115677499842437119
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.937 × 10⁹⁶(97-digit number)
19370630230541868402…45115677499842437119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.874 × 10⁹⁶(97-digit number)
38741260461083736804…90231354999684874239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.748 × 10⁹⁶(97-digit number)
77482520922167473608…80462709999369748479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.549 × 10⁹⁷(98-digit number)
15496504184433494721…60925419998739496959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.099 × 10⁹⁷(98-digit number)
30993008368866989443…21850839997478993919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.198 × 10⁹⁷(98-digit number)
61986016737733978886…43701679994957987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.239 × 10⁹⁸(99-digit number)
12397203347546795777…87403359989915975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.479 × 10⁹⁸(99-digit number)
24794406695093591554…74806719979831951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.958 × 10⁹⁸(99-digit number)
49588813390187183109…49613439959663902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.917 × 10⁹⁸(99-digit number)
99177626780374366218…99226879919327805439
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,727,036 XPM·at block #6,810,369 · 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