Block #2,551,379

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2018, 5:58:54 AM · Difficulty 10.9893 · 4,279,475 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7de883441a8ff8da27d163b1872fcae10c54c408faaf0cafd1f1c156c5758894

Height

#2,551,379

Difficulty

10.989344

Transactions

64

Size

18.56 KB

Version

2

Bits

0afd45ae

Nonce

1,234,685,550

Timestamp

3/6/2018, 5:58:54 AM

Confirmations

4,279,475

Merkle Root

e66296b9ed1d6e4a51d756593abb551a7dcfd120a7d71b14223cacc158972459
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.440 × 10⁹⁴(95-digit number)
14403225804370784519…75994685062230988801
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.440 × 10⁹⁴(95-digit number)
14403225804370784519…75994685062230988801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.880 × 10⁹⁴(95-digit number)
28806451608741569038…51989370124461977601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.761 × 10⁹⁴(95-digit number)
57612903217483138077…03978740248923955201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.152 × 10⁹⁵(96-digit number)
11522580643496627615…07957480497847910401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.304 × 10⁹⁵(96-digit number)
23045161286993255230…15914960995695820801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.609 × 10⁹⁵(96-digit number)
46090322573986510461…31829921991391641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.218 × 10⁹⁵(96-digit number)
92180645147973020923…63659843982783283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.843 × 10⁹⁶(97-digit number)
18436129029594604184…27319687965566566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.687 × 10⁹⁶(97-digit number)
36872258059189208369…54639375931133132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.374 × 10⁹⁶(97-digit number)
73744516118378416739…09278751862266265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.474 × 10⁹⁷(98-digit number)
14748903223675683347…18557503724532531201
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,890,968 XPM·at block #6,830,853 · 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