Block #2,471,524

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2018, 7:17:39 PM · Difficulty 10.9621 · 4,370,659 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
be2077e97269332bdd1c44ed437fce3f869c99e38ded4dc8f303435205ff6634

Height

#2,471,524

Difficulty

10.962060

Transactions

6

Size

1.55 KB

Version

2

Bits

0af6498d

Nonce

91,631,849

Timestamp

1/13/2018, 7:17:39 PM

Confirmations

4,370,659

Merkle Root

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

3.042 × 10⁹⁶(97-digit number)
30429254502355485155…37449643135974558721
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
3.042 × 10⁹⁶(97-digit number)
30429254502355485155…37449643135974558721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.085 × 10⁹⁶(97-digit number)
60858509004710970310…74899286271949117441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.217 × 10⁹⁷(98-digit number)
12171701800942194062…49798572543898234881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.434 × 10⁹⁷(98-digit number)
24343403601884388124…99597145087796469761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.868 × 10⁹⁷(98-digit number)
48686807203768776248…99194290175592939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.737 × 10⁹⁷(98-digit number)
97373614407537552497…98388580351185879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.947 × 10⁹⁸(99-digit number)
19474722881507510499…96777160702371758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.894 × 10⁹⁸(99-digit number)
38949445763015020998…93554321404743516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.789 × 10⁹⁸(99-digit number)
77898891526030041997…87108642809487032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.557 × 10⁹⁹(100-digit number)
15579778305206008399…74217285618974064641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,981,856 XPM·at block #6,842,182 · 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