Block #2,137,004

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/29/2017, 3:59:20 PM · Difficulty 10.8909 · 4,688,357 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eda1546fc902e73b998ebd0d24ac5d0c2c41ab902b00f3f464872c010359c5dd

Height

#2,137,004

Difficulty

10.890864

Transactions

8

Size

4.30 KB

Version

2

Bits

0ae40fa3

Nonce

490,663,871

Timestamp

5/29/2017, 3:59:20 PM

Confirmations

4,688,357

Merkle Root

cad1df6c345f123b69788beae359a7965e91897cd163620ff987358f31430d7e
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.308 × 10⁹⁶(97-digit number)
13080397549190939157…22520455742528020479
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.308 × 10⁹⁶(97-digit number)
13080397549190939157…22520455742528020479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.616 × 10⁹⁶(97-digit number)
26160795098381878314…45040911485056040959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.232 × 10⁹⁶(97-digit number)
52321590196763756628…90081822970112081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.046 × 10⁹⁷(98-digit number)
10464318039352751325…80163645940224163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.092 × 10⁹⁷(98-digit number)
20928636078705502651…60327291880448327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.185 × 10⁹⁷(98-digit number)
41857272157411005303…20654583760896655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.371 × 10⁹⁷(98-digit number)
83714544314822010606…41309167521793310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.674 × 10⁹⁸(99-digit number)
16742908862964402121…82618335043586621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.348 × 10⁹⁸(99-digit number)
33485817725928804242…65236670087173242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.697 × 10⁹⁸(99-digit number)
66971635451857608484…30473340174346485759
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,846,994 XPM·at block #6,825,360 · 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