Block #2,114,371

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2017, 2:39:01 PM · Difficulty 10.9001 · 4,728,274 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2d5c561855b495cf649d0f7901c1d17ed94cd16a920bc2d8ea943e6fd340f9a9

Height

#2,114,371

Difficulty

10.900087

Transactions

5

Size

2.69 KB

Version

2

Bits

0ae66c1b

Nonce

1,930,258,899

Timestamp

5/13/2017, 2:39:01 PM

Confirmations

4,728,274

Merkle Root

5fc26e0d6928f7e29a86a5c6f85dfc062d8d8b440facc78a187b89b08879593f
Transactions (5)
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.

3.281 × 10⁹⁴(95-digit number)
32813796354303599554…23746888936607913519
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
3.281 × 10⁹⁴(95-digit number)
32813796354303599554…23746888936607913519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.562 × 10⁹⁴(95-digit number)
65627592708607199108…47493777873215827039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.312 × 10⁹⁵(96-digit number)
13125518541721439821…94987555746431654079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.625 × 10⁹⁵(96-digit number)
26251037083442879643…89975111492863308159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.250 × 10⁹⁵(96-digit number)
52502074166885759286…79950222985726616319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.050 × 10⁹⁶(97-digit number)
10500414833377151857…59900445971453232639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.100 × 10⁹⁶(97-digit number)
21000829666754303714…19800891942906465279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.200 × 10⁹⁶(97-digit number)
42001659333508607429…39601783885812930559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.400 × 10⁹⁶(97-digit number)
84003318667017214858…79203567771625861119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.680 × 10⁹⁷(98-digit number)
16800663733403442971…58407135543251722239
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,985,594 XPM·at block #6,842,644 · 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