Block #2,191,219

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/3/2017, 2:46:08 PM · Difficulty 10.9505 · 4,650,643 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f11a39cf46e382299fce1a7bd79ff808aeb83c914855d4ee8ce316d1eed26d19

Height

#2,191,219

Difficulty

10.950500

Transactions

6

Size

4.18 KB

Version

2

Bits

0af353fb

Nonce

1,091,093,666

Timestamp

7/3/2017, 2:46:08 PM

Confirmations

4,650,643

Merkle Root

f5a19f4313769e7869382c2af421d6d48626e3470e6a62bcaef71085b756224f
Transactions (6)
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.

8.898 × 10⁹⁴(95-digit number)
88986213741405356988…48560210786866039041
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
8.898 × 10⁹⁴(95-digit number)
88986213741405356988…48560210786866039041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.779 × 10⁹⁵(96-digit number)
17797242748281071397…97120421573732078081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.559 × 10⁹⁵(96-digit number)
35594485496562142795…94240843147464156161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.118 × 10⁹⁵(96-digit number)
71188970993124285590…88481686294928312321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.423 × 10⁹⁶(97-digit number)
14237794198624857118…76963372589856624641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.847 × 10⁹⁶(97-digit number)
28475588397249714236…53926745179713249281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.695 × 10⁹⁶(97-digit number)
56951176794499428472…07853490359426498561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.139 × 10⁹⁷(98-digit number)
11390235358899885694…15706980718852997121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.278 × 10⁹⁷(98-digit number)
22780470717799771388…31413961437705994241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.556 × 10⁹⁷(98-digit number)
45560941435599542777…62827922875411988481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.112 × 10⁹⁷(98-digit number)
91121882871199085555…25655845750823976961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,979,273 XPM·at block #6,841,861 · 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