Block #2,667,288

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/18/2018, 8:00:28 PM · Difficulty 11.6699 · 4,174,499 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0697559690298488429b5148e2c10eeb92b2a25a426f825816d52e900d2af22

Height

#2,667,288

Difficulty

11.669867

Transactions

2

Size

1021 B

Version

2

Bits

0bab7c66

Nonce

61,908,914

Timestamp

5/18/2018, 8:00:28 PM

Confirmations

4,174,499

Merkle Root

a9c18734d70b94e24dd9622cdf671bc27bd10f29e27760d7721093e11d036e14
Transactions (2)
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.

6.873 × 10⁹⁷(98-digit number)
68732594270205242263…11922753917884989441
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
6.873 × 10⁹⁷(98-digit number)
68732594270205242263…11922753917884989441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.374 × 10⁹⁸(99-digit number)
13746518854041048452…23845507835769978881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.749 × 10⁹⁸(99-digit number)
27493037708082096905…47691015671539957761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.498 × 10⁹⁸(99-digit number)
54986075416164193810…95382031343079915521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.099 × 10⁹⁹(100-digit number)
10997215083232838762…90764062686159831041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.199 × 10⁹⁹(100-digit number)
21994430166465677524…81528125372319662081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.398 × 10⁹⁹(100-digit number)
43988860332931355048…63056250744639324161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.797 × 10⁹⁹(100-digit number)
87977720665862710097…26112501489278648321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.759 × 10¹⁰⁰(101-digit number)
17595544133172542019…52225002978557296641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.519 × 10¹⁰⁰(101-digit number)
35191088266345084039…04450005957114593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.038 × 10¹⁰⁰(101-digit number)
70382176532690168078…08900011914229186561
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,978,674 XPM·at block #6,841,786 · 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