Block #2,114,539

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2017, 5:15:21 PM · Difficulty 10.9003 · 4,726,708 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
843db9ea7b24680b790122aef7aa5da275e7daa25914a908d82663dae3e54668

Height

#2,114,539

Difficulty

10.900317

Transactions

2

Size

881 B

Version

2

Bits

0ae67b32

Nonce

587,058,930

Timestamp

5/13/2017, 5:15:21 PM

Confirmations

4,726,708

Merkle Root

4e7d19443b8b04bb34ab0a0932a3f151e288896c7e705149a085edd3e13b811b
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.563 × 10⁹⁴(95-digit number)
15634201514117430504…59592094226078335999
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.563 × 10⁹⁴(95-digit number)
15634201514117430504…59592094226078335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.126 × 10⁹⁴(95-digit number)
31268403028234861008…19184188452156671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.253 × 10⁹⁴(95-digit number)
62536806056469722016…38368376904313343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.250 × 10⁹⁵(96-digit number)
12507361211293944403…76736753808626687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.501 × 10⁹⁵(96-digit number)
25014722422587888806…53473507617253375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.002 × 10⁹⁵(96-digit number)
50029444845175777613…06947015234506751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.000 × 10⁹⁶(97-digit number)
10005888969035155522…13894030469013503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.001 × 10⁹⁶(97-digit number)
20011777938070311045…27788060938027007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.002 × 10⁹⁶(97-digit number)
40023555876140622090…55576121876054015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.004 × 10⁹⁶(97-digit number)
80047111752281244181…11152243752108031999
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,974,338 XPM·at block #6,841,246 · 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