Block #2,116,841

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2017, 3:55:57 AM · Difficulty 10.9047 · 4,726,410 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1654de1a4c6d21f4bf426a7b14e71c905b0d351e718324959ba93fd2acd296cb

Height

#2,116,841

Difficulty

10.904664

Transactions

2

Size

872 B

Version

2

Bits

0ae79814

Nonce

774,944,351

Timestamp

5/15/2017, 3:55:57 AM

Confirmations

4,726,410

Merkle Root

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

9.701 × 10⁹⁶(97-digit number)
97017537281386013499…95383932301352704001
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.701 × 10⁹⁶(97-digit number)
97017537281386013499…95383932301352704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.940 × 10⁹⁷(98-digit number)
19403507456277202699…90767864602705408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.880 × 10⁹⁷(98-digit number)
38807014912554405399…81535729205410816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.761 × 10⁹⁷(98-digit number)
77614029825108810799…63071458410821632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.552 × 10⁹⁸(99-digit number)
15522805965021762159…26142916821643264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.104 × 10⁹⁸(99-digit number)
31045611930043524319…52285833643286528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.209 × 10⁹⁸(99-digit number)
62091223860087048639…04571667286573056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.241 × 10⁹⁹(100-digit number)
12418244772017409727…09143334573146112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.483 × 10⁹⁹(100-digit number)
24836489544034819455…18286669146292224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.967 × 10⁹⁹(100-digit number)
49672979088069638911…36573338292584448001
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,384 XPM·at block #6,843,250 · 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