Block #2,802,371

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2018, 4:15:14 PM · Difficulty 11.6709 · 4,039,655 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9bc5ed3da03040153651b33089c06816fd5184f616c75cd645130f5c332fe456

Height

#2,802,371

Difficulty

11.670921

Transactions

19

Size

5.74 KB

Version

2

Bits

0babc179

Nonce

623,325,760

Timestamp

8/20/2018, 4:15:14 PM

Confirmations

4,039,655

Merkle Root

e470b276523af9fc0bca490b883266140d6c61e939cd954bb0e64a4ec786cf7e
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.031 × 10⁹⁵(96-digit number)
20314918481129935698…50009800481777917441
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.031 × 10⁹⁵(96-digit number)
20314918481129935698…50009800481777917441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.062 × 10⁹⁵(96-digit number)
40629836962259871396…00019600963555834881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.125 × 10⁹⁵(96-digit number)
81259673924519742793…00039201927111669761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.625 × 10⁹⁶(97-digit number)
16251934784903948558…00078403854223339521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.250 × 10⁹⁶(97-digit number)
32503869569807897117…00156807708446679041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.500 × 10⁹⁶(97-digit number)
65007739139615794235…00313615416893358081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.300 × 10⁹⁷(98-digit number)
13001547827923158847…00627230833786716161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.600 × 10⁹⁷(98-digit number)
26003095655846317694…01254461667573432321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.200 × 10⁹⁷(98-digit number)
52006191311692635388…02508923335146864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.040 × 10⁹⁸(99-digit number)
10401238262338527077…05017846670293729281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.080 × 10⁹⁸(99-digit number)
20802476524677054155…10035693340587458561
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,594 XPM·at block #6,842,025 · 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