Block #2,813,786

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2018, 12:45:53 PM · Difficulty 11.6782 · 4,031,342 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9deeefb6dd7f938677dadd04cb183349da2a4df4169591df79f5a12bbbe29d54

Height

#2,813,786

Difficulty

11.678191

Transactions

11

Size

2.44 KB

Version

2

Bits

0bad9de5

Nonce

278,193,463

Timestamp

8/28/2018, 12:45:53 PM

Confirmations

4,031,342

Merkle Root

696b7bd229797826e0fed9a8571e5fcdcf553a58635e58decfdee2e986ad1a69
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.507 × 10⁹⁷(98-digit number)
25070203697437250879…92569247792335247361
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.507 × 10⁹⁷(98-digit number)
25070203697437250879…92569247792335247361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.014 × 10⁹⁷(98-digit number)
50140407394874501759…85138495584670494721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.002 × 10⁹⁸(99-digit number)
10028081478974900351…70276991169340989441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.005 × 10⁹⁸(99-digit number)
20056162957949800703…40553982338681978881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.011 × 10⁹⁸(99-digit number)
40112325915899601407…81107964677363957761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.022 × 10⁹⁸(99-digit number)
80224651831799202815…62215929354727915521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.604 × 10⁹⁹(100-digit number)
16044930366359840563…24431858709455831041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.208 × 10⁹⁹(100-digit number)
32089860732719681126…48863717418911662081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.417 × 10⁹⁹(100-digit number)
64179721465439362252…97727434837823324161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.283 × 10¹⁰⁰(101-digit number)
12835944293087872450…95454869675646648321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.567 × 10¹⁰⁰(101-digit number)
25671888586175744900…90909739351293296641
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:58,005,451 XPM·at block #6,845,127 · 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