Block #2,646,209

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2018, 6:19:02 AM · Difficulty 11.7463 · 4,196,376 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5dcd52fb5ff3db3ca6c575d30e7f5e3fe08bc3b76300c0ac8d79e5500c0c5110

Height

#2,646,209

Difficulty

11.746341

Transactions

5

Size

2.76 KB

Version

2

Bits

0bbf102f

Nonce

1,400,361,941

Timestamp

5/3/2018, 6:19:02 AM

Confirmations

4,196,376

Merkle Root

1efbbe43aa10fa351f1b609ab0e1c63e2a27b2c8e37112d2f51c8eb0297f9007
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.869 × 10⁹⁵(96-digit number)
28691891702899590996…17243573309771207879
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.869 × 10⁹⁵(96-digit number)
28691891702899590996…17243573309771207879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.738 × 10⁹⁵(96-digit number)
57383783405799181992…34487146619542415759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.147 × 10⁹⁶(97-digit number)
11476756681159836398…68974293239084831519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.295 × 10⁹⁶(97-digit number)
22953513362319672796…37948586478169663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.590 × 10⁹⁶(97-digit number)
45907026724639345593…75897172956339326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.181 × 10⁹⁶(97-digit number)
91814053449278691187…51794345912678652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.836 × 10⁹⁷(98-digit number)
18362810689855738237…03588691825357304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.672 × 10⁹⁷(98-digit number)
36725621379711476475…07177383650714608639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.345 × 10⁹⁷(98-digit number)
73451242759422952950…14354767301429217279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.469 × 10⁹⁸(99-digit number)
14690248551884590590…28709534602858434559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.938 × 10⁹⁸(99-digit number)
29380497103769181180…57419069205716869119
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,985,109 XPM·at block #6,842,584 · 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