Block #3,994,645

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2020, 4:04:14 PM · Difficulty 10.8430 · 2,823,387 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b4dab94096f3977bbc36a60617e057862e5e6015d8a65261859b255f106b50d6

Height

#3,994,645

Difficulty

10.842998

Transactions

6

Size

3.47 KB

Version

2

Bits

0ad7ceb1

Nonce

319,359,165

Timestamp

12/16/2020, 4:04:14 PM

Confirmations

2,823,387

Merkle Root

4028189d05b716a296f3401459de94d2e423d3aa544d1a2725088beb77ff6a9c
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.

6.893 × 10⁹⁴(95-digit number)
68936050675470158722…38130759435221060621
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
6.893 × 10⁹⁴(95-digit number)
68936050675470158722…38130759435221060621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.378 × 10⁹⁵(96-digit number)
13787210135094031744…76261518870442121241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.757 × 10⁹⁵(96-digit number)
27574420270188063488…52523037740884242481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.514 × 10⁹⁵(96-digit number)
55148840540376126977…05046075481768484961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.102 × 10⁹⁶(97-digit number)
11029768108075225395…10092150963536969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.205 × 10⁹⁶(97-digit number)
22059536216150450791…20184301927073939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.411 × 10⁹⁶(97-digit number)
44119072432300901582…40368603854147879681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.823 × 10⁹⁶(97-digit number)
88238144864601803164…80737207708295759361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.764 × 10⁹⁷(98-digit number)
17647628972920360632…61474415416591518721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.529 × 10⁹⁷(98-digit number)
35295257945840721265…22948830833183037441
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,788,325 XPM·at block #6,818,031 · 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