Block #2,456,330

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2018, 10:37:08 PM · Difficulty 10.9533 · 4,384,589 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7d6f384982e13727b7fb08df4de8f1edf2b6fd0a95d27a8d7d5a620f309ca32

Height

#2,456,330

Difficulty

10.953266

Transactions

31

Size

7.21 KB

Version

2

Bits

0af40938

Nonce

940,714,424

Timestamp

1/3/2018, 10:37:08 PM

Confirmations

4,384,589

Merkle Root

e342ad1f1604e91f2f488119ea4811423236edf28f71e72150d423b13ce3d6b8
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.691 × 10⁹⁴(95-digit number)
66911634661270410746…02594440449213663901
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.691 × 10⁹⁴(95-digit number)
66911634661270410746…02594440449213663901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.338 × 10⁹⁵(96-digit number)
13382326932254082149…05188880898427327801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.676 × 10⁹⁵(96-digit number)
26764653864508164298…10377761796854655601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.352 × 10⁹⁵(96-digit number)
53529307729016328597…20755523593709311201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.070 × 10⁹⁶(97-digit number)
10705861545803265719…41511047187418622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.141 × 10⁹⁶(97-digit number)
21411723091606531438…83022094374837244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.282 × 10⁹⁶(97-digit number)
42823446183213062877…66044188749674489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.564 × 10⁹⁶(97-digit number)
85646892366426125755…32088377499348979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.712 × 10⁹⁷(98-digit number)
17129378473285225151…64176754998697958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.425 × 10⁹⁷(98-digit number)
34258756946570450302…28353509997395916801
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,971,703 XPM·at block #6,840,918 · 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