Block #2,105,982

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2017, 4:42:22 AM · Difficulty 10.8873 · 4,735,874 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa0aa6c748e644bd6502e0669a296ed3e534d1ae4453b98eb7654556f34afe8e

Height

#2,105,982

Difficulty

10.887343

Transactions

3

Size

655 B

Version

2

Bits

0ae328eb

Nonce

210,276,566

Timestamp

5/8/2017, 4:42:22 AM

Confirmations

4,735,874

Merkle Root

8c518b61980713d1e286854e061fc9f043c8effc4f4322aa7dbf3729e1f45ab8
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.

1.344 × 10⁹⁷(98-digit number)
13443213894993436279…49202212863608944641
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.344 × 10⁹⁷(98-digit number)
13443213894993436279…49202212863608944641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.688 × 10⁹⁷(98-digit number)
26886427789986872559…98404425727217889281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.377 × 10⁹⁷(98-digit number)
53772855579973745119…96808851454435778561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.075 × 10⁹⁸(99-digit number)
10754571115994749023…93617702908871557121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.150 × 10⁹⁸(99-digit number)
21509142231989498047…87235405817743114241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.301 × 10⁹⁸(99-digit number)
43018284463978996095…74470811635486228481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.603 × 10⁹⁸(99-digit number)
86036568927957992191…48941623270972456961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.720 × 10⁹⁹(100-digit number)
17207313785591598438…97883246541944913921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.441 × 10⁹⁹(100-digit number)
34414627571183196876…95766493083889827841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.882 × 10⁹⁹(100-digit number)
68829255142366393752…91532986167779655681
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,979,224 XPM·at block #6,841,855 · 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