Block #2,770,997

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/29/2018, 11:47:04 PM · Difficulty 11.6601 · 4,070,906 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ea21ad8e33244fb60311351df53df72a582b320192cab835746f89d0d3edcd8

Height

#2,770,997

Difficulty

11.660133

Transactions

23

Size

6.23 KB

Version

2

Bits

0ba8fe7b

Nonce

1,320,430,578

Timestamp

7/29/2018, 11:47:04 PM

Confirmations

4,070,906

Merkle Root

198974ea1b331540de5531b513adbe3d7e76602e441b96a1363ee9e29761abb7
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.

5.429 × 10⁹⁶(97-digit number)
54293461651860165994…63760441050428287041
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
5.429 × 10⁹⁶(97-digit number)
54293461651860165994…63760441050428287041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.085 × 10⁹⁷(98-digit number)
10858692330372033198…27520882100856574081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.171 × 10⁹⁷(98-digit number)
21717384660744066397…55041764201713148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.343 × 10⁹⁷(98-digit number)
43434769321488132795…10083528403426296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.686 × 10⁹⁷(98-digit number)
86869538642976265590…20167056806852592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.737 × 10⁹⁸(99-digit number)
17373907728595253118…40334113613705185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.474 × 10⁹⁸(99-digit number)
34747815457190506236…80668227227410370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.949 × 10⁹⁸(99-digit number)
69495630914381012472…61336454454820741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.389 × 10⁹⁹(100-digit number)
13899126182876202494…22672908909641482241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.779 × 10⁹⁹(100-digit number)
27798252365752404989…45345817819282964481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.559 × 10⁹⁹(100-digit number)
55596504731504809978…90691635638565928961
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,598 XPM·at block #6,841,902 · 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