Block #2,193,888

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2017, 7:31:54 AM · Difficulty 10.9527 · 4,647,236 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d5855e4756f954cc2f600b2dc22094733893c00ad72dabf5b6194fab1d563db8

Height

#2,193,888

Difficulty

10.952723

Transactions

9

Size

2.31 KB

Version

2

Bits

0af3e5ab

Nonce

322,947,366

Timestamp

7/5/2017, 7:31:54 AM

Confirmations

4,647,236

Merkle Root

42a7d146e92aef8336462bc503094e0565bf3f22df044ab7a640589acf53d8c1
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.008 × 10⁹³(94-digit number)
20086537493676816620…58809744952408166399
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.008 × 10⁹³(94-digit number)
20086537493676816620…58809744952408166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.017 × 10⁹³(94-digit number)
40173074987353633241…17619489904816332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.034 × 10⁹³(94-digit number)
80346149974707266483…35238979809632665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.606 × 10⁹⁴(95-digit number)
16069229994941453296…70477959619265331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.213 × 10⁹⁴(95-digit number)
32138459989882906593…40955919238530662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.427 × 10⁹⁴(95-digit number)
64276919979765813186…81911838477061324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.285 × 10⁹⁵(96-digit number)
12855383995953162637…63823676954122649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.571 × 10⁹⁵(96-digit number)
25710767991906325274…27647353908245299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.142 × 10⁹⁵(96-digit number)
51421535983812650549…55294707816490598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.028 × 10⁹⁶(97-digit number)
10284307196762530109…10589415632981196799
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,973,361 XPM·at block #6,841,123 · 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