Block #2,127,043

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2017, 4:41:07 PM · Difficulty 10.9189 · 4,690,929 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
30f154ca789bf1e08d56ae61e53430fd5ff2efefb0ca110514fc993ceba7d42d

Height

#2,127,043

Difficulty

10.918923

Transactions

19

Size

9.04 KB

Version

2

Bits

0aeb3e8d

Nonce

401,070,891

Timestamp

5/21/2017, 4:41:07 PM

Confirmations

4,690,929

Merkle Root

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

2.304 × 10⁹⁶(97-digit number)
23049714564657190697…48823062550210078721
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
2.304 × 10⁹⁶(97-digit number)
23049714564657190697…48823062550210078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.609 × 10⁹⁶(97-digit number)
46099429129314381395…97646125100420157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.219 × 10⁹⁶(97-digit number)
92198858258628762791…95292250200840314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.843 × 10⁹⁷(98-digit number)
18439771651725752558…90584500401680629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.687 × 10⁹⁷(98-digit number)
36879543303451505116…81169000803361259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.375 × 10⁹⁷(98-digit number)
73759086606903010233…62338001606722519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.475 × 10⁹⁸(99-digit number)
14751817321380602046…24676003213445038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.950 × 10⁹⁸(99-digit number)
29503634642761204093…49352006426890076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.900 × 10⁹⁸(99-digit number)
59007269285522408186…98704012853780152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.180 × 10⁹⁹(100-digit number)
11801453857104481637…97408025707560304641
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,787,846 XPM·at block #6,817,971 · 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