Block #2,121,886

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/18/2017, 7:00:17 AM · Difficulty 10.9145 · 4,721,568 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bc8e6dc3b844d72c0b1f0d027139665e6d60d69cb0bd88c63be6961a6d79e3d2

Height

#2,121,886

Difficulty

10.914509

Transactions

5

Size

2.20 KB

Version

2

Bits

0aea1d3d

Nonce

322,944,639

Timestamp

5/18/2017, 7:00:17 AM

Confirmations

4,721,568

Merkle Root

322ed1c3d96fa0014e3a38900a36bbf5b48f6b3497a2668487a07f520c26003d
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.318 × 10⁹⁴(95-digit number)
23189212800189455294…32721710458714762239
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.318 × 10⁹⁴(95-digit number)
23189212800189455294…32721710458714762239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.637 × 10⁹⁴(95-digit number)
46378425600378910588…65443420917429524479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.275 × 10⁹⁴(95-digit number)
92756851200757821177…30886841834859048959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.855 × 10⁹⁵(96-digit number)
18551370240151564235…61773683669718097919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.710 × 10⁹⁵(96-digit number)
37102740480303128470…23547367339436195839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.420 × 10⁹⁵(96-digit number)
74205480960606256941…47094734678872391679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.484 × 10⁹⁶(97-digit number)
14841096192121251388…94189469357744783359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.968 × 10⁹⁶(97-digit number)
29682192384242502776…88378938715489566719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.936 × 10⁹⁶(97-digit number)
59364384768485005553…76757877430979133439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.187 × 10⁹⁷(98-digit number)
11872876953697001110…53515754861958266879
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,992,000 XPM·at block #6,843,453 · 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