Block #3,559,988

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2020, 12:29:20 PM · Difficulty 10.9096 · 3,247,757 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
64d1d53ab6f0a9a5c6bbb5641078bc351c0d2e1cdce5353d8da0a32a090875a5

Height

#3,559,988

Difficulty

10.909647

Transactions

11

Size

2.40 KB

Version

2

Bits

0ae8dea0

Nonce

1,164,513,135

Timestamp

2/16/2020, 12:29:20 PM

Confirmations

3,247,757

Merkle Root

8aa366a6b97a5674824059900b25238ab7b9e79bc68f4e32b43d201810fb10d9
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.887 × 10⁹²(93-digit number)
18874636479943693737…97419322657515041651
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.887 × 10⁹²(93-digit number)
18874636479943693737…97419322657515041651
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.774 × 10⁹²(93-digit number)
37749272959887387475…94838645315030083301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.549 × 10⁹²(93-digit number)
75498545919774774951…89677290630060166601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.509 × 10⁹³(94-digit number)
15099709183954954990…79354581260120333201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.019 × 10⁹³(94-digit number)
30199418367909909980…58709162520240666401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.039 × 10⁹³(94-digit number)
60398836735819819961…17418325040481332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.207 × 10⁹⁴(95-digit number)
12079767347163963992…34836650080962665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.415 × 10⁹⁴(95-digit number)
24159534694327927984…69673300161925331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.831 × 10⁹⁴(95-digit number)
48319069388655855969…39346600323850662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.663 × 10⁹⁴(95-digit number)
96638138777311711938…78693200647701324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.932 × 10⁹⁵(96-digit number)
19327627755462342387…57386401295402649601
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,705,997 XPM·at block #6,807,744 · 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.

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