Block #2,654,884

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2018, 5:24:20 PM · Difficulty 11.7130 · 4,185,876 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11c24720c6f4197b909aaed7f6994ecab92afc0fd5ae381645ec0daebc71ee29

Height

#2,654,884

Difficulty

11.713002

Transactions

9

Size

2.90 KB

Version

2

Bits

0bb68750

Nonce

1,794,102,542

Timestamp

5/9/2018, 5:24:20 PM

Confirmations

4,185,876

Merkle Root

2eb636556751cd4a1337ab2141705a6fbcef6ade99b67ff91fbeaf183d370bc9
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.967 × 10⁹⁶(97-digit number)
19676118687883093421…58167379967613427201
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.967 × 10⁹⁶(97-digit number)
19676118687883093421…58167379967613427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.935 × 10⁹⁶(97-digit number)
39352237375766186842…16334759935226854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.870 × 10⁹⁶(97-digit number)
78704474751532373684…32669519870453708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.574 × 10⁹⁷(98-digit number)
15740894950306474736…65339039740907417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.148 × 10⁹⁷(98-digit number)
31481789900612949473…30678079481814835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.296 × 10⁹⁷(98-digit number)
62963579801225898947…61356158963629670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.259 × 10⁹⁸(99-digit number)
12592715960245179789…22712317927259340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.518 × 10⁹⁸(99-digit number)
25185431920490359579…45424635854518681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.037 × 10⁹⁸(99-digit number)
50370863840980719158…90849271709037363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.007 × 10⁹⁹(100-digit number)
10074172768196143831…81698543418074726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.014 × 10⁹⁹(100-digit number)
20148345536392287663…63397086836149452801
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,970,421 XPM·at block #6,840,759 · 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