1. #6,841,486TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #2,391,249

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/23/2017, 3:57:32 AM · Difficulty 10.8729 · 4,450,238 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
215410024e89c0dfb70c5a7ddad175efc0ec92e2dbd9dcab842243c23ba0ac7b

Height

#2,391,249

Difficulty

10.872874

Transactions

20

Size

5.74 KB

Version

2

Bits

0adf74aa

Nonce

1,033,514,174

Timestamp

11/23/2017, 3:57:32 AM

Confirmations

4,450,238

Merkle Root

2137f012d56058a5635961f9005cef0864753b1cff9d7ac6f82d68ed19829296
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.

4.820 × 10⁹⁴(95-digit number)
48208031840454449713…95582781413086369921
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
4.820 × 10⁹⁴(95-digit number)
48208031840454449713…95582781413086369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.641 × 10⁹⁴(95-digit number)
96416063680908899427…91165562826172739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.928 × 10⁹⁵(96-digit number)
19283212736181779885…82331125652345479681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.856 × 10⁹⁵(96-digit number)
38566425472363559770…64662251304690959361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.713 × 10⁹⁵(96-digit number)
77132850944727119541…29324502609381918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.542 × 10⁹⁶(97-digit number)
15426570188945423908…58649005218763837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.085 × 10⁹⁶(97-digit number)
30853140377890847816…17298010437527674881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.170 × 10⁹⁶(97-digit number)
61706280755781695633…34596020875055349761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.234 × 10⁹⁷(98-digit number)
12341256151156339126…69192041750110699521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.468 × 10⁹⁷(98-digit number)
24682512302312678253…38384083500221399041
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,976,272 XPM·at block #6,841,486 · 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