Block #2,234,920

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/3/2017, 9:02:27 AM · Difficulty 10.9457 · 4,607,338 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
37ef2bfa9989e8b9ad50625abd2c6b2c081e840fd197f4782a94212ed9f18305

Height

#2,234,920

Difficulty

10.945687

Transactions

2

Size

868 B

Version

2

Bits

0af21888

Nonce

42,346,110

Timestamp

8/3/2017, 9:02:27 AM

Confirmations

4,607,338

Merkle Root

374955e1d73f6e9dc9a627f31ea7a6fe597ed1c9a9b4035ba5576250f11d2664
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.

1.565 × 10⁹⁴(95-digit number)
15651505759868407302…45506126728680676519
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.565 × 10⁹⁴(95-digit number)
15651505759868407302…45506126728680676519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.130 × 10⁹⁴(95-digit number)
31303011519736814605…91012253457361353039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.260 × 10⁹⁴(95-digit number)
62606023039473629210…82024506914722706079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.252 × 10⁹⁵(96-digit number)
12521204607894725842…64049013829445412159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.504 × 10⁹⁵(96-digit number)
25042409215789451684…28098027658890824319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.008 × 10⁹⁵(96-digit number)
50084818431578903368…56196055317781648639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.001 × 10⁹⁶(97-digit number)
10016963686315780673…12392110635563297279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.003 × 10⁹⁶(97-digit number)
20033927372631561347…24784221271126594559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.006 × 10⁹⁶(97-digit number)
40067854745263122694…49568442542253189119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.013 × 10⁹⁶(97-digit number)
80135709490526245388…99136885084506378239
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,982,462 XPM·at block #6,842,257 · 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