Block #2,149,845

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/7/2017, 8:16:23 AM · Difficulty 10.8984 · 4,688,950 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e58a9e0828f6cfbfc2f546be75b612697db23054c23d74bde6f156e43421db76

Height

#2,149,845

Difficulty

10.898365

Transactions

2

Size

427 B

Version

2

Bits

0ae5fb43

Nonce

259,527,872

Timestamp

6/7/2017, 8:16:23 AM

Confirmations

4,688,950

Merkle Root

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

8.376 × 10⁹⁵(96-digit number)
83764183348622450903…73973889259436984321
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
8.376 × 10⁹⁵(96-digit number)
83764183348622450903…73973889259436984321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.675 × 10⁹⁶(97-digit number)
16752836669724490180…47947778518873968641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.350 × 10⁹⁶(97-digit number)
33505673339448980361…95895557037747937281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.701 × 10⁹⁶(97-digit number)
67011346678897960723…91791114075495874561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.340 × 10⁹⁷(98-digit number)
13402269335779592144…83582228150991749121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.680 × 10⁹⁷(98-digit number)
26804538671559184289…67164456301983498241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.360 × 10⁹⁷(98-digit number)
53609077343118368578…34328912603966996481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.072 × 10⁹⁸(99-digit number)
10721815468623673715…68657825207933992961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.144 × 10⁹⁸(99-digit number)
21443630937247347431…37315650415867985921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.288 × 10⁹⁸(99-digit number)
42887261874494694862…74631300831735971841
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,954,623 XPM·at block #6,838,794 · 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