Block #2,668,852

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2018, 8:19:34 PM · Difficulty 11.6768 · 4,168,930 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e4ab749618f86ec48879a9cdb7fcc04b05764cec145b6848d03b229660240a2

Height

#2,668,852

Difficulty

11.676760

Transactions

4

Size

2.70 KB

Version

2

Bits

0bad402b

Nonce

416,489,222

Timestamp

5/19/2018, 8:19:34 PM

Confirmations

4,168,930

Merkle Root

3d48ac22c7ca0b2d80845d7de1f07d4970cf7ccbd67a3deb091d16b73c6b07b1
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.162 × 10⁹⁶(97-digit number)
11627711648244928715…81050943550168024321
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.162 × 10⁹⁶(97-digit number)
11627711648244928715…81050943550168024321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.325 × 10⁹⁶(97-digit number)
23255423296489857431…62101887100336048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.651 × 10⁹⁶(97-digit number)
46510846592979714862…24203774200672097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.302 × 10⁹⁶(97-digit number)
93021693185959429725…48407548401344194561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.860 × 10⁹⁷(98-digit number)
18604338637191885945…96815096802688389121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.720 × 10⁹⁷(98-digit number)
37208677274383771890…93630193605376778241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.441 × 10⁹⁷(98-digit number)
74417354548767543780…87260387210753556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.488 × 10⁹⁸(99-digit number)
14883470909753508756…74520774421507112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.976 × 10⁹⁸(99-digit number)
29766941819507017512…49041548843014225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.953 × 10⁹⁸(99-digit number)
59533883639014035024…98083097686028451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.190 × 10⁹⁹(100-digit number)
11906776727802807004…96166195372056903681
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,946,593 XPM·at block #6,837,781 · 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