Block #2,161,843

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/15/2017, 2:33:53 PM · Difficulty 10.9008 · 4,648,032 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
66158006c220ec2698d77b918262c168e944986f755d7145637779192a10b0e3

Height

#2,161,843

Difficulty

10.900820

Transactions

4

Size

4.61 KB

Version

2

Bits

0ae69c20

Nonce

8,827,417

Timestamp

6/15/2017, 2:33:53 PM

Confirmations

4,648,032

Merkle Root

32fbb462568ec6a657380a2234c09cfb10d29fec0e3b6a1f73aca211d1cb11cb
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.485 × 10⁹⁶(97-digit number)
24855647387205224655…04097177968944142079
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.485 × 10⁹⁶(97-digit number)
24855647387205224655…04097177968944142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.971 × 10⁹⁶(97-digit number)
49711294774410449311…08194355937888284159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.942 × 10⁹⁶(97-digit number)
99422589548820898623…16388711875776568319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.988 × 10⁹⁷(98-digit number)
19884517909764179724…32777423751553136639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.976 × 10⁹⁷(98-digit number)
39769035819528359449…65554847503106273279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.953 × 10⁹⁷(98-digit number)
79538071639056718898…31109695006212546559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.590 × 10⁹⁸(99-digit number)
15907614327811343779…62219390012425093119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.181 × 10⁹⁸(99-digit number)
31815228655622687559…24438780024850186239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.363 × 10⁹⁸(99-digit number)
63630457311245375118…48877560049700372479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.272 × 10⁹⁹(100-digit number)
12726091462249075023…97755120099400744959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.545 × 10⁹⁹(100-digit number)
25452182924498150047…95510240198801489919
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,723,086 XPM·at block #6,809,874 · 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.

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