Block #2,109,520

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2017, 5:25:23 AM · Difficulty 10.9004 · 4,704,593 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21959a56e7a671a328950fd6d3cb8a195e47f40b27f7826ad33762648a69995e

Height

#2,109,520

Difficulty

10.900382

Transactions

6

Size

9.91 KB

Version

2

Bits

0ae67f72

Nonce

1,219,756,368

Timestamp

5/10/2017, 5:25:23 AM

Confirmations

4,704,593

Merkle Root

0368c5a129483fe6f073d17d7d033578f06c4f57ff27a0efa39c51f084bc3336
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.029 × 10⁹⁵(96-digit number)
20297617050909972377…62515403939010076799
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.029 × 10⁹⁵(96-digit number)
20297617050909972377…62515403939010076799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.059 × 10⁹⁵(96-digit number)
40595234101819944754…25030807878020153599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.119 × 10⁹⁵(96-digit number)
81190468203639889509…50061615756040307199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.623 × 10⁹⁶(97-digit number)
16238093640727977901…00123231512080614399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.247 × 10⁹⁶(97-digit number)
32476187281455955803…00246463024161228799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.495 × 10⁹⁶(97-digit number)
64952374562911911607…00492926048322457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.299 × 10⁹⁷(98-digit number)
12990474912582382321…00985852096644915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.598 × 10⁹⁷(98-digit number)
25980949825164764643…01971704193289830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.196 × 10⁹⁷(98-digit number)
51961899650329529286…03943408386579660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.039 × 10⁹⁸(99-digit number)
10392379930065905857…07886816773159321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.078 × 10⁹⁸(99-digit number)
20784759860131811714…15773633546318643199
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,756,986 XPM·at block #6,814,112 · 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