Block #2,041,974

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2017, 10:22:41 AM · Difficulty 10.6711 · 4,800,360 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9460987bcace42f57c09ab64560acaf3003099c032bd175bf4380227e2a45adf

Height

#2,041,974

Difficulty

10.671054

Transactions

24

Size

9.32 KB

Version

2

Bits

0aabca2a

Nonce

541,481,483

Timestamp

3/28/2017, 10:22:41 AM

Confirmations

4,800,360

Merkle Root

9897fefe1b88a5a78524b0cc63563c85bf57a774f9573567bf25261dec717203
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.

1.273 × 10⁹⁷(98-digit number)
12737415906811921684…34650399778711848961
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
1.273 × 10⁹⁷(98-digit number)
12737415906811921684…34650399778711848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.547 × 10⁹⁷(98-digit number)
25474831813623843369…69300799557423697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.094 × 10⁹⁷(98-digit number)
50949663627247686738…38601599114847395841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.018 × 10⁹⁸(99-digit number)
10189932725449537347…77203198229694791681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.037 × 10⁹⁸(99-digit number)
20379865450899074695…54406396459389583361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.075 × 10⁹⁸(99-digit number)
40759730901798149391…08812792918779166721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.151 × 10⁹⁸(99-digit number)
81519461803596298782…17625585837558333441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.630 × 10⁹⁹(100-digit number)
16303892360719259756…35251171675116666881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.260 × 10⁹⁹(100-digit number)
32607784721438519512…70502343350233333761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.521 × 10⁹⁹(100-digit number)
65215569442877039025…41004686700466667521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.304 × 10¹⁰⁰(101-digit number)
13043113888575407805…82009373400933335041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,983,078 XPM·at block #6,842,333 · 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