Block #2,272,898

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/29/2017, 5:15:08 AM · Difficulty 10.9544 · 4,570,401 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6cf5e866f26a09eb2d782b22e7619c856b1f8b863bac7d2f391f45dbddbca494

Height

#2,272,898

Difficulty

10.954400

Transactions

2

Size

427 B

Version

2

Bits

0af45390

Nonce

1,223,550,427

Timestamp

8/29/2017, 5:15:08 AM

Confirmations

4,570,401

Merkle Root

79904da9e8a906b13036542f54426675807b87168445bb6ce4747274efdb08a5
Transactions (2)
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.952 × 10⁹⁶(97-digit number)
69528652861048331356…70848122318915850241
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.952 × 10⁹⁶(97-digit number)
69528652861048331356…70848122318915850241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.390 × 10⁹⁷(98-digit number)
13905730572209666271…41696244637831700481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.781 × 10⁹⁷(98-digit number)
27811461144419332542…83392489275663400961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.562 × 10⁹⁷(98-digit number)
55622922288838665085…66784978551326801921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.112 × 10⁹⁸(99-digit number)
11124584457767733017…33569957102653603841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.224 × 10⁹⁸(99-digit number)
22249168915535466034…67139914205307207681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.449 × 10⁹⁸(99-digit number)
44498337831070932068…34279828410614415361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.899 × 10⁹⁸(99-digit number)
88996675662141864136…68559656821228830721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.779 × 10⁹⁹(100-digit number)
17799335132428372827…37119313642457661441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.559 × 10⁹⁹(100-digit number)
35598670264856745654…74238627284915322881
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,990,757 XPM·at block #6,843,298 · 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