Block #2,126,984

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/21/2017, 3:37:45 PM · Difficulty 10.9190 · 4,687,406 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3a18b006752c5192c595b9e8df492237714f5ade81fc4219a06673bff6e2f347

Height

#2,126,984

Difficulty

10.918987

Transactions

23

Size

11.12 KB

Version

2

Bits

0aeb42b7

Nonce

1,136,259,506

Timestamp

5/21/2017, 3:37:45 PM

Confirmations

4,687,406

Merkle Root

0abb19678db4da2a525e84de9f3b6b4ebcf0aa10eb88156870227544573af770
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.

8.194 × 10⁹⁵(96-digit number)
81945600966600777997…03589287578507453439
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
8.194 × 10⁹⁵(96-digit number)
81945600966600777997…03589287578507453439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.638 × 10⁹⁶(97-digit number)
16389120193320155599…07178575157014906879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.277 × 10⁹⁶(97-digit number)
32778240386640311199…14357150314029813759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.555 × 10⁹⁶(97-digit number)
65556480773280622398…28714300628059627519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13111296154656124479…57428601256119255039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.622 × 10⁹⁷(98-digit number)
26222592309312248959…14857202512238510079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.244 × 10⁹⁷(98-digit number)
52445184618624497918…29714405024477020159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.048 × 10⁹⁸(99-digit number)
10489036923724899583…59428810048954040319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.097 × 10⁹⁸(99-digit number)
20978073847449799167…18857620097908080639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.195 × 10⁹⁸(99-digit number)
41956147694899598334…37715240195816161279
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,759,181 XPM·at block #6,814,389 · 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