Block #2,669,572

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2018, 7:38:46 AM · Difficulty 11.6792 · 4,171,371 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7ff612730d29ab914eb49a2e3d43f9f68b8d16d2d5605553b5404dcccb07826

Height

#2,669,572

Difficulty

11.679235

Transactions

3

Size

1.00 KB

Version

2

Bits

0bade259

Nonce

221,646,575

Timestamp

5/20/2018, 7:38:46 AM

Confirmations

4,171,371

Merkle Root

8288c2a31e4643886ee11d8553cbe10db21f4ba360ee82ee8ffbad94d43b482b
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.894 × 10⁹³(94-digit number)
68946041975194401155…44286680331751864641
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.894 × 10⁹³(94-digit number)
68946041975194401155…44286680331751864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.378 × 10⁹⁴(95-digit number)
13789208395038880231…88573360663503729281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.757 × 10⁹⁴(95-digit number)
27578416790077760462…77146721327007458561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.515 × 10⁹⁴(95-digit number)
55156833580155520924…54293442654014917121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.103 × 10⁹⁵(96-digit number)
11031366716031104184…08586885308029834241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.206 × 10⁹⁵(96-digit number)
22062733432062208369…17173770616059668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.412 × 10⁹⁵(96-digit number)
44125466864124416739…34347541232119336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.825 × 10⁹⁵(96-digit number)
88250933728248833478…68695082464238673921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.765 × 10⁹⁶(97-digit number)
17650186745649766695…37390164928477347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.530 × 10⁹⁶(97-digit number)
35300373491299533391…74780329856954695681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.060 × 10⁹⁶(97-digit number)
70600746982599066783…49560659713909391361
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,971,897 XPM·at block #6,840,942 · 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