Block #2,536,971

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/24/2018, 7:43:02 PM · Difficulty 10.9870 · 4,304,056 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1093d0199a2d4454c9a7b9874bc1834e692f4675a3f449e65e5655a4cb34ddb4

Height

#2,536,971

Difficulty

10.986976

Transactions

55

Size

17.65 KB

Version

2

Bits

0afcaa76

Nonce

98,534,966

Timestamp

2/24/2018, 7:43:02 PM

Confirmations

4,304,056

Merkle Root

f801e3f775d8ac9d683ab7ba692c81283e6d0e9098800755813276f0b2b0ff4d
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.036 × 10⁹⁵(96-digit number)
10369408085107982107…74890035632870041601
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.036 × 10⁹⁵(96-digit number)
10369408085107982107…74890035632870041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.073 × 10⁹⁵(96-digit number)
20738816170215964214…49780071265740083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.147 × 10⁹⁵(96-digit number)
41477632340431928428…99560142531480166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.295 × 10⁹⁵(96-digit number)
82955264680863856857…99120285062960332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.659 × 10⁹⁶(97-digit number)
16591052936172771371…98240570125920665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.318 × 10⁹⁶(97-digit number)
33182105872345542742…96481140251841331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.636 × 10⁹⁶(97-digit number)
66364211744691085485…92962280503682662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.327 × 10⁹⁷(98-digit number)
13272842348938217097…85924561007365324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.654 × 10⁹⁷(98-digit number)
26545684697876434194…71849122014730649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.309 × 10⁹⁷(98-digit number)
53091369395752868388…43698244029461299201
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,972,574 XPM·at block #6,841,026 · 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