Block #2,110,044

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2017, 12:49:00 PM · Difficulty 10.9020 · 4,726,711 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
028c10306914627c102be5b96f7be53074f8518bea662667774b5521ceaa2212

Height

#2,110,044

Difficulty

10.901990

Transactions

3

Size

653 B

Version

2

Bits

0ae6e8d1

Nonce

27,068,084

Timestamp

5/10/2017, 12:49:00 PM

Confirmations

4,726,711

Merkle Root

d3840b3b3cfe1f8cc97c69d29d40a5c01ee5be5d54a77d0492c05143c299f4eb
Transactions (3)
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.

5.889 × 10⁹³(94-digit number)
58894081551603279758…00547365115201612801
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
5.889 × 10⁹³(94-digit number)
58894081551603279758…00547365115201612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.177 × 10⁹⁴(95-digit number)
11778816310320655951…01094730230403225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.355 × 10⁹⁴(95-digit number)
23557632620641311903…02189460460806451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.711 × 10⁹⁴(95-digit number)
47115265241282623806…04378920921612902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.423 × 10⁹⁴(95-digit number)
94230530482565247613…08757841843225804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.884 × 10⁹⁵(96-digit number)
18846106096513049522…17515683686451609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.769 × 10⁹⁵(96-digit number)
37692212193026099045…35031367372903219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.538 × 10⁹⁵(96-digit number)
75384424386052198090…70062734745806438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.507 × 10⁹⁶(97-digit number)
15076884877210439618…40125469491612876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.015 × 10⁹⁶(97-digit number)
30153769754420879236…80250938983225753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.030 × 10⁹⁶(97-digit number)
60307539508841758472…60501877966451507201
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,938,327 XPM·at block #6,836,754 · 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