Block #2,114,528

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2017, 5:09:44 PM · Difficulty 10.9003 · 4,703,244 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d6a1b27a27b5789e3d425898c5581f3b1dae2ac9af921e91c2fec5d2aa50bef

Height

#2,114,528

Difficulty

10.900252

Transactions

3

Size

2.34 KB

Version

2

Bits

0ae676ef

Nonce

69,374,354

Timestamp

5/13/2017, 5:09:44 PM

Confirmations

4,703,244

Merkle Root

211093a599b7b8e0a70b1842553f62d488c998374b54661fae087fa6ec28cca2
Transactions (3)
1 in → 1 out8.4400 XPM109 B
10 in → 1 out7857.9528 XPM1.49 KB
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.

7.539 × 10⁹⁶(97-digit number)
75390913046945705409…89395642268518369279
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
7.539 × 10⁹⁶(97-digit number)
75390913046945705409…89395642268518369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.507 × 10⁹⁷(98-digit number)
15078182609389141081…78791284537036738559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.015 × 10⁹⁷(98-digit number)
30156365218778282163…57582569074073477119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.031 × 10⁹⁷(98-digit number)
60312730437556564327…15165138148146954239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.206 × 10⁹⁸(99-digit number)
12062546087511312865…30330276296293908479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.412 × 10⁹⁸(99-digit number)
24125092175022625730…60660552592587816959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.825 × 10⁹⁸(99-digit number)
48250184350045251461…21321105185175633919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.650 × 10⁹⁸(99-digit number)
96500368700090502923…42642210370351267839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.930 × 10⁹⁹(100-digit number)
19300073740018100584…85284420740702535679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.860 × 10⁹⁹(100-digit number)
38600147480036201169…70568841481405071359
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,786,233 XPM·at block #6,817,771 · 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