Block #2,287,054

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2017, 12:00:50 AM · Difficulty 10.9555 · 4,538,992 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b2288483b4457360a70e5f67f99bafc0a1f93251c8af88d939204794cd9f0559

Height

#2,287,054

Difficulty

10.955524

Transactions

3

Size

2.23 KB

Version

2

Bits

0af49d38

Nonce

1,646,852,993

Timestamp

9/8/2017, 12:00:50 AM

Confirmations

4,538,992

Merkle Root

0b59a22501bd712b5848fb5c03be12a88a284b1999687fbd6fb673a92858a62d
Transactions (3)
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.051 × 10⁹⁶(97-digit number)
30519998812957976390…56213499870523274241
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.051 × 10⁹⁶(97-digit number)
30519998812957976390…56213499870523274241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.103 × 10⁹⁶(97-digit number)
61039997625915952780…12426999741046548481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.220 × 10⁹⁷(98-digit number)
12207999525183190556…24853999482093096961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.441 × 10⁹⁷(98-digit number)
24415999050366381112…49707998964186193921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.883 × 10⁹⁷(98-digit number)
48831998100732762224…99415997928372387841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.766 × 10⁹⁷(98-digit number)
97663996201465524449…98831995856744775681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.953 × 10⁹⁸(99-digit number)
19532799240293104889…97663991713489551361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.906 × 10⁹⁸(99-digit number)
39065598480586209779…95327983426979102721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.813 × 10⁹⁸(99-digit number)
78131196961172419559…90655966853958205441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.562 × 10⁹⁹(100-digit number)
15626239392234483911…81311933707916410881
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,852,494 XPM·at block #6,826,045 · 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