Block #2,097,431

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2017, 4:48:43 PM · Difficulty 10.8720 · 4,716,764 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9d80c208a02768d5f6c1e35c58eab44732796b4472d62ed2ea4a6e2247895d1c

Height

#2,097,431

Difficulty

10.871973

Transactions

4

Size

29.99 KB

Version

2

Bits

0adf399c

Nonce

494,027,263

Timestamp

5/2/2017, 4:48:43 PM

Confirmations

4,716,764

Merkle Root

89158ae33b5849be9836ad391cccf2a9e14efd404080891b37371d1c6b78524b
Transactions (4)
1 in → 1 out10.1100 XPM109 B
53 in → 1 out47.0000 XPM7.70 KB
151 in → 1 out52.0000 XPM21.87 KB
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.681 × 10⁹⁶(97-digit number)
26819974614946763203…21139804731510717441
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.681 × 10⁹⁶(97-digit number)
26819974614946763203…21139804731510717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.363 × 10⁹⁶(97-digit number)
53639949229893526406…42279609463021434881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.072 × 10⁹⁷(98-digit number)
10727989845978705281…84559218926042869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.145 × 10⁹⁷(98-digit number)
21455979691957410562…69118437852085739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.291 × 10⁹⁷(98-digit number)
42911959383914821125…38236875704171479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.582 × 10⁹⁷(98-digit number)
85823918767829642250…76473751408342958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.716 × 10⁹⁸(99-digit number)
17164783753565928450…52947502816685916161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.432 × 10⁹⁸(99-digit number)
34329567507131856900…05895005633371832321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.865 × 10⁹⁸(99-digit number)
68659135014263713800…11790011266743664641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.373 × 10⁹⁹(100-digit number)
13731827002852742760…23580022533487329281
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,757,634 XPM·at block #6,814,194 · 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