Block #2,116,682

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/15/2017, 1:26:25 AM · Difficulty 10.9045 · 4,708,513 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d6d99debc0bf33e40f0a62152a6896547b3cbd56ab765f1efff641a179e79cd

Height

#2,116,682

Difficulty

10.904506

Transactions

3

Size

52.93 KB

Version

2

Bits

0ae78dba

Nonce

1,482,984,485

Timestamp

5/15/2017, 1:26:25 AM

Confirmations

4,708,513

Merkle Root

02e71a89a73fbfb3aec9f225cf8f2ca030082e2503f2917ab2ee0a6386461f31
Transactions (3)
1 in → 1 out9.0600 XPM109 B
3 in → 1 out236.9900 XPM489 B
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.831 × 10⁹⁵(96-digit number)
18318509587717472773…46810143534932361279
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.831 × 10⁹⁵(96-digit number)
18318509587717472773…46810143534932361279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.663 × 10⁹⁵(96-digit number)
36637019175434945547…93620287069864722559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.327 × 10⁹⁵(96-digit number)
73274038350869891095…87240574139729445119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.465 × 10⁹⁶(97-digit number)
14654807670173978219…74481148279458890239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.930 × 10⁹⁶(97-digit number)
29309615340347956438…48962296558917780479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.861 × 10⁹⁶(97-digit number)
58619230680695912876…97924593117835560959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.172 × 10⁹⁷(98-digit number)
11723846136139182575…95849186235671121919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.344 × 10⁹⁷(98-digit number)
23447692272278365150…91698372471342243839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.689 × 10⁹⁷(98-digit number)
46895384544556730301…83396744942684487679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.379 × 10⁹⁷(98-digit number)
93790769089113460602…66793489885368975359
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,845,652 XPM·at block #6,825,194 · 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