Block #2,881,224

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/14/2018, 9:15:33 PM · Difficulty 11.6293 · 3,964,033 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
88d15a1af6f239f210acf7b3bc752455230216cce996d22edd4c67b45ca51c8c

Height

#2,881,224

Difficulty

11.629329

Transactions

8

Size

2.37 KB

Version

2

Bits

0ba11bb6

Nonce

679,592,314

Timestamp

10/14/2018, 9:15:33 PM

Confirmations

3,964,033

Merkle Root

3175e6ac5df595ab0c6b1c2cc279f9e775229d1268338312d019a2d856de38b8
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.

4.451 × 10⁹⁴(95-digit number)
44514968956341184003…12923811271917519361
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
4.451 × 10⁹⁴(95-digit number)
44514968956341184003…12923811271917519361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.902 × 10⁹⁴(95-digit number)
89029937912682368007…25847622543835038721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.780 × 10⁹⁵(96-digit number)
17805987582536473601…51695245087670077441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.561 × 10⁹⁵(96-digit number)
35611975165072947202…03390490175340154881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.122 × 10⁹⁵(96-digit number)
71223950330145894405…06780980350680309761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.424 × 10⁹⁶(97-digit number)
14244790066029178881…13561960701360619521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.848 × 10⁹⁶(97-digit number)
28489580132058357762…27123921402721239041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.697 × 10⁹⁶(97-digit number)
56979160264116715524…54247842805442478081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.139 × 10⁹⁷(98-digit number)
11395832052823343104…08495685610884956161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.279 × 10⁹⁷(98-digit number)
22791664105646686209…16991371221769912321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.558 × 10⁹⁷(98-digit number)
45583328211293372419…33982742443539824641
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,006,489 XPM·at block #6,845,256 · 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