Block #2,137,863

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2017, 9:51:47 AM · Difficulty 10.8861 · 4,705,134 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56e44b25fd22e5970c8694af270357050ea38644ab7354e84c500aab5c5ddacd

Height

#2,137,863

Difficulty

10.886137

Transactions

2

Size

426 B

Version

2

Bits

0ae2d9dc

Nonce

1,379,402,740

Timestamp

5/30/2017, 9:51:47 AM

Confirmations

4,705,134

Merkle Root

3b962392d07a636a319818cf83df9fb0739582dd57ecefa185b5ea247aa4c40b
Transactions (2)
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.

4.676 × 10⁹⁵(96-digit number)
46762841992697457778…51648885088381873919
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
4.676 × 10⁹⁵(96-digit number)
46762841992697457778…51648885088381873919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.352 × 10⁹⁵(96-digit number)
93525683985394915557…03297770176763747839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.870 × 10⁹⁶(97-digit number)
18705136797078983111…06595540353527495679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.741 × 10⁹⁶(97-digit number)
37410273594157966222…13191080707054991359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.482 × 10⁹⁶(97-digit number)
74820547188315932445…26382161414109982719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.496 × 10⁹⁷(98-digit number)
14964109437663186489…52764322828219965439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.992 × 10⁹⁷(98-digit number)
29928218875326372978…05528645656439930879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.985 × 10⁹⁷(98-digit number)
59856437750652745956…11057291312879861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.197 × 10⁹⁸(99-digit number)
11971287550130549191…22114582625759723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.394 × 10⁹⁸(99-digit number)
23942575100261098382…44229165251519447039
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,988,331 XPM·at block #6,842,996 · 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