Block #2,644,510

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 1:02:36 PM · Difficulty 11.7107 · 4,188,951 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3715791d95aaf2c0292a8e77dc903f394a580ddd99b0d3013e550574a652fffb

Height

#2,644,510

Difficulty

11.710680

Transactions

2

Size

719 B

Version

2

Bits

0bb5ef25

Nonce

221,251,847

Timestamp

5/2/2018, 1:02:36 PM

Confirmations

4,188,951

Merkle Root

c5d13c4d9a5fbb80395695857feaa2d3262e79890a0b49afc3f3f993b7a49d7d
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.

8.394 × 10⁹³(94-digit number)
83940400637302332270…03023284107121592321
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
8.394 × 10⁹³(94-digit number)
83940400637302332270…03023284107121592321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.678 × 10⁹⁴(95-digit number)
16788080127460466454…06046568214243184641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.357 × 10⁹⁴(95-digit number)
33576160254920932908…12093136428486369281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.715 × 10⁹⁴(95-digit number)
67152320509841865816…24186272856972738561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.343 × 10⁹⁵(96-digit number)
13430464101968373163…48372545713945477121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.686 × 10⁹⁵(96-digit number)
26860928203936746326…96745091427890954241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.372 × 10⁹⁵(96-digit number)
53721856407873492653…93490182855781908481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.074 × 10⁹⁶(97-digit number)
10744371281574698530…86980365711563816961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.148 × 10⁹⁶(97-digit number)
21488742563149397061…73960731423127633921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.297 × 10⁹⁶(97-digit number)
42977485126298794122…47921462846255267841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.595 × 10⁹⁶(97-digit number)
85954970252597588244…95842925692510535681
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,911,888 XPM·at block #6,833,460 · 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