Block #2,576,329

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2018, 6:50:02 PM · Difficulty 10.9957 · 4,267,694 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e4654b8e4d018c5ce53a2215684a6694cf2b739231c5f19ecc1c5fa0e1d9ff53

Height

#2,576,329

Difficulty

10.995697

Transactions

19

Size

4.32 KB

Version

2

Bits

0afee5fa

Nonce

1,013,524,480

Timestamp

3/20/2018, 6:50:02 PM

Confirmations

4,267,694

Merkle Root

70839a83ca970ff0dc099e202b652a42399c2297252f247e4c41ef2e15ecffb6
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.

2.825 × 10⁹⁴(95-digit number)
28257959678100764223…81389635485330000721
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
2.825 × 10⁹⁴(95-digit number)
28257959678100764223…81389635485330000721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.651 × 10⁹⁴(95-digit number)
56515919356201528446…62779270970660001441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.130 × 10⁹⁵(96-digit number)
11303183871240305689…25558541941320002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.260 × 10⁹⁵(96-digit number)
22606367742480611378…51117083882640005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.521 × 10⁹⁵(96-digit number)
45212735484961222756…02234167765280011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.042 × 10⁹⁵(96-digit number)
90425470969922445513…04468335530560023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.808 × 10⁹⁶(97-digit number)
18085094193984489102…08936671061120046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.617 × 10⁹⁶(97-digit number)
36170188387968978205…17873342122240092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.234 × 10⁹⁶(97-digit number)
72340376775937956410…35746684244480184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.446 × 10⁹⁷(98-digit number)
14468075355187591282…71493368488960368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.893 × 10⁹⁷(98-digit number)
28936150710375182564…42986736977920737281
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,996,566 XPM·at block #6,844,022 · 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