Block #2,238,172

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/5/2017, 2:48:24 PM · Difficulty 10.9461 · 4,593,581 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a55d4ca0fc5d8c24bef7a00b29bfbded889cb4456e5f2365d979ade03f97f9ea

Height

#2,238,172

Difficulty

10.946088

Transactions

15

Size

4.67 KB

Version

2

Bits

0af232db

Nonce

1,353,097,609

Timestamp

8/5/2017, 2:48:24 PM

Confirmations

4,593,581

Merkle Root

a5a357f761f4cc896d1f8e988eba9440540b4c0541a2161ef9abb5679c5d5331
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.

9.581 × 10⁹⁵(96-digit number)
95812944137703015432…20382986921970484481
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
9.581 × 10⁹⁵(96-digit number)
95812944137703015432…20382986921970484481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.916 × 10⁹⁶(97-digit number)
19162588827540603086…40765973843940968961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.832 × 10⁹⁶(97-digit number)
38325177655081206173…81531947687881937921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.665 × 10⁹⁶(97-digit number)
76650355310162412346…63063895375763875841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.533 × 10⁹⁷(98-digit number)
15330071062032482469…26127790751527751681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.066 × 10⁹⁷(98-digit number)
30660142124064964938…52255581503055503361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.132 × 10⁹⁷(98-digit number)
61320284248129929876…04511163006111006721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.226 × 10⁹⁸(99-digit number)
12264056849625985975…09022326012222013441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.452 × 10⁹⁸(99-digit number)
24528113699251971950…18044652024444026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.905 × 10⁹⁸(99-digit number)
49056227398503943901…36089304048888053761
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,898,132 XPM·at block #6,831,752 · 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