Block #2,666,667

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/18/2018, 9:48:24 AM · Difficulty 11.6691 · 4,176,239 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
82f22f538872b0ca63705ad8040df13e3442f2ce284ac409d14d88c5b9fd98bc

Height

#2,666,667

Difficulty

11.669124

Transactions

4

Size

1.44 KB

Version

2

Bits

0bab4bb4

Nonce

118,439,067

Timestamp

5/18/2018, 9:48:24 AM

Confirmations

4,176,239

Merkle Root

5b8ed16729499c67b9dd59d99cb270fa65b08c77413fb0aba6baae84cb953b84
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.

2.321 × 10⁹³(94-digit number)
23214498049067521153…05933236539805194241
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
2.321 × 10⁹³(94-digit number)
23214498049067521153…05933236539805194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.642 × 10⁹³(94-digit number)
46428996098135042306…11866473079610388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.285 × 10⁹³(94-digit number)
92857992196270084613…23732946159220776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.857 × 10⁹⁴(95-digit number)
18571598439254016922…47465892318441553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.714 × 10⁹⁴(95-digit number)
37143196878508033845…94931784636883107841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.428 × 10⁹⁴(95-digit number)
74286393757016067690…89863569273766215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.485 × 10⁹⁵(96-digit number)
14857278751403213538…79727138547532431361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.971 × 10⁹⁵(96-digit number)
29714557502806427076…59454277095064862721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.942 × 10⁹⁵(96-digit number)
59429115005612854152…18908554190129725441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.188 × 10⁹⁶(97-digit number)
11885823001122570830…37817108380259450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.377 × 10⁹⁶(97-digit number)
23771646002245141661…75634216760518901761
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,987,596 XPM·at block #6,842,905 · 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