Block #3,415,518

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/1/2019, 3:23:04 PM · Difficulty 10.9840 · 3,411,406 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
af8d71d8e342aec58ee4a341b49007514f96b8a1baee48db2ba1c8c2990d0f3d

Height

#3,415,518

Difficulty

10.983994

Transactions

4

Size

1.08 KB

Version

2

Bits

0afbe705

Nonce

951,136,058

Timestamp

11/1/2019, 3:23:04 PM

Confirmations

3,411,406

Merkle Root

2ce21dbca1fd5232fb2fccdfcd480084418d2eb48c321bf80feeed7587c73f27
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.

3.609 × 10⁹⁵(96-digit number)
36092248018567428364…91875433502061260801
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
3.609 × 10⁹⁵(96-digit number)
36092248018567428364…91875433502061260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.218 × 10⁹⁵(96-digit number)
72184496037134856728…83750867004122521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.443 × 10⁹⁶(97-digit number)
14436899207426971345…67501734008245043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.887 × 10⁹⁶(97-digit number)
28873798414853942691…35003468016490086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.774 × 10⁹⁶(97-digit number)
57747596829707885383…70006936032980172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.154 × 10⁹⁷(98-digit number)
11549519365941577076…40013872065960345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.309 × 10⁹⁷(98-digit number)
23099038731883154153…80027744131920691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.619 × 10⁹⁷(98-digit number)
46198077463766308306…60055488263841382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.239 × 10⁹⁷(98-digit number)
92396154927532616612…20110976527682764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.847 × 10⁹⁸(99-digit number)
18479230985506523322…40221953055365529601
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,859,563 XPM·at block #6,826,923 · 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