Block #2,724,897

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/28/2018, 8:32:31 AM · Difficulty 11.6196 · 4,108,138 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6365bf8cc9919dc0d072d2f0463d934602143ffe91b1df8ade52e8c4b0e6dee

Height

#2,724,897

Difficulty

11.619608

Transactions

6

Size

1.90 KB

Version

2

Bits

0b9e9ea9

Nonce

809,674,070

Timestamp

6/28/2018, 8:32:31 AM

Confirmations

4,108,138

Merkle Root

24b90ea2221182f14c06f2b19dad2ea110de023eebf084d0e260a3fd5f1c839c
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.347 × 10⁹⁴(95-digit number)
63477866448304471058…65977190285163250721
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.347 × 10⁹⁴(95-digit number)
63477866448304471058…65977190285163250721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.269 × 10⁹⁵(96-digit number)
12695573289660894211…31954380570326501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.539 × 10⁹⁵(96-digit number)
25391146579321788423…63908761140653002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.078 × 10⁹⁵(96-digit number)
50782293158643576846…27817522281306005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.015 × 10⁹⁶(97-digit number)
10156458631728715369…55635044562612011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.031 × 10⁹⁶(97-digit number)
20312917263457430738…11270089125224023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.062 × 10⁹⁶(97-digit number)
40625834526914861477…22540178250448046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.125 × 10⁹⁶(97-digit number)
81251669053829722954…45080356500896092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.625 × 10⁹⁷(98-digit number)
16250333810765944590…90160713001792184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.250 × 10⁹⁷(98-digit number)
32500667621531889181…80321426003584368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.500 × 10⁹⁷(98-digit number)
65001335243063778363…60642852007168737281
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,908,458 XPM·at block #6,833,034 · 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