Block #2,858,623

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/28/2018, 4:04:17 PM · Difficulty 11.6798 · 3,983,350 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
31514dc3892d916aecc3b5b776c8f61cc81c20f7a01eae8709d8d8cec1e770ef

Height

#2,858,623

Difficulty

11.679763

Transactions

4

Size

1.13 KB

Version

2

Bits

0bae04fb

Nonce

2,076,176,063

Timestamp

9/28/2018, 4:04:17 PM

Confirmations

3,983,350

Merkle Root

fbf2177cadbe37c066ecc21f907b5719e7f2a983ef85d6508a55bdb9bb05a757
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.

1.861 × 10⁹⁵(96-digit number)
18613212416576533826…73824312376389111041
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
1.861 × 10⁹⁵(96-digit number)
18613212416576533826…73824312376389111041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.722 × 10⁹⁵(96-digit number)
37226424833153067653…47648624752778222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.445 × 10⁹⁵(96-digit number)
74452849666306135306…95297249505556444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.489 × 10⁹⁶(97-digit number)
14890569933261227061…90594499011112888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.978 × 10⁹⁶(97-digit number)
29781139866522454122…81188998022225776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.956 × 10⁹⁶(97-digit number)
59562279733044908244…62377996044451553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.191 × 10⁹⁷(98-digit number)
11912455946608981648…24755992088903106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.382 × 10⁹⁷(98-digit number)
23824911893217963297…49511984177806213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.764 × 10⁹⁷(98-digit number)
47649823786435926595…99023968355612426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.529 × 10⁹⁷(98-digit number)
95299647572871853191…98047936711224852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.905 × 10⁹⁸(99-digit number)
19059929514574370638…96095873422449704961
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,980,168 XPM·at block #6,841,972 · 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