Block #2,138,205

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2017, 4:36:24 PM · Difficulty 10.8848 · 4,704,147 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d1e29289e88a16dc1fc3911a820a937e410181c9d484d1761457823ee7d0ca24

Height

#2,138,205

Difficulty

10.884756

Transactions

5

Size

1.08 KB

Version

2

Bits

0ae27f66

Nonce

339,206,880

Timestamp

5/30/2017, 4:36:24 PM

Confirmations

4,704,147

Merkle Root

aeb7735422f498613199f744ac2f48b49e3d13a339406459016807a84073c247
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.

2.638 × 10⁹⁴(95-digit number)
26386260469366985891…37517982744224172319
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
2.638 × 10⁹⁴(95-digit number)
26386260469366985891…37517982744224172319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.277 × 10⁹⁴(95-digit number)
52772520938733971783…75035965488448344639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.055 × 10⁹⁵(96-digit number)
10554504187746794356…50071930976896689279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.110 × 10⁹⁵(96-digit number)
21109008375493588713…00143861953793378559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.221 × 10⁹⁵(96-digit number)
42218016750987177426…00287723907586757119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.443 × 10⁹⁵(96-digit number)
84436033501974354853…00575447815173514239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.688 × 10⁹⁶(97-digit number)
16887206700394870970…01150895630347028479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.377 × 10⁹⁶(97-digit number)
33774413400789741941…02301791260694056959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.754 × 10⁹⁶(97-digit number)
67548826801579483883…04603582521388113919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.350 × 10⁹⁷(98-digit number)
13509765360315896776…09207165042776227839
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,983,222 XPM·at block #6,842,351 · 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