Block #2,180,341

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/27/2017, 3:57:33 AM · Difficulty 10.9317 · 4,662,515 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3f51c9e2c4e10fa0c7071bc6ca67d6f01991e4d675447472b37c419b4ffc185d

Height

#2,180,341

Difficulty

10.931743

Transactions

2

Size

822 B

Version

2

Bits

0aee86b9

Nonce

2,129,453,956

Timestamp

6/27/2017, 3:57:33 AM

Confirmations

4,662,515

Merkle Root

38264bcb6bbba5d4aa94b91b1efbd36a58d911b599523dba5a27f4af923ccdfd
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.

3.341 × 10⁹⁵(96-digit number)
33413051798314050792…60898031834151585599
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
3.341 × 10⁹⁵(96-digit number)
33413051798314050792…60898031834151585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.682 × 10⁹⁵(96-digit number)
66826103596628101584…21796063668303171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.336 × 10⁹⁶(97-digit number)
13365220719325620316…43592127336606342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.673 × 10⁹⁶(97-digit number)
26730441438651240633…87184254673212684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.346 × 10⁹⁶(97-digit number)
53460882877302481267…74368509346425369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.069 × 10⁹⁷(98-digit number)
10692176575460496253…48737018692850739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.138 × 10⁹⁷(98-digit number)
21384353150920992507…97474037385701478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.276 × 10⁹⁷(98-digit number)
42768706301841985014…94948074771402956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.553 × 10⁹⁷(98-digit number)
85537412603683970028…89896149542805913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.710 × 10⁹⁸(99-digit number)
17107482520736794005…79792299085611827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.421 × 10⁹⁸(99-digit number)
34214965041473588011…59584598171223654399
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,987,195 XPM·at block #6,842,855 · 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