Block #2,668,322

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2018, 11:40:04 AM · Difficulty 11.6759 · 4,170,851 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
629b00c1da0034ead053024a7a9afc2d31f72219bb8afc42d317d9c807529b42

Height

#2,668,322

Difficulty

11.675931

Transactions

3

Size

1.22 KB

Version

2

Bits

0bad09d2

Nonce

1,197,218,109

Timestamp

5/19/2018, 11:40:04 AM

Confirmations

4,170,851

Merkle Root

228f1586aefa8e85daaeffdaac7e37dc49f6303ce669ccc59298afd55aa8d858
Transactions (3)
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.368 × 10⁹⁶(97-digit number)
13689710625492554157…43582350690251223041
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.368 × 10⁹⁶(97-digit number)
13689710625492554157…43582350690251223041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.737 × 10⁹⁶(97-digit number)
27379421250985108314…87164701380502446081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.475 × 10⁹⁶(97-digit number)
54758842501970216629…74329402761004892161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.095 × 10⁹⁷(98-digit number)
10951768500394043325…48658805522009784321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.190 × 10⁹⁷(98-digit number)
21903537000788086651…97317611044019568641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.380 × 10⁹⁷(98-digit number)
43807074001576173303…94635222088039137281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.761 × 10⁹⁷(98-digit number)
87614148003152346607…89270444176078274561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.752 × 10⁹⁸(99-digit number)
17522829600630469321…78540888352156549121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.504 × 10⁹⁸(99-digit number)
35045659201260938643…57081776704313098241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.009 × 10⁹⁸(99-digit number)
70091318402521877286…14163553408626196481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.401 × 10⁹⁹(100-digit number)
14018263680504375457…28327106817252392961
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,957,665 XPM·at block #6,839,172 · 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