Block #3,590,298

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2020, 4:00:20 PM · Difficulty 10.9080 · 3,253,527 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0592891e30d1b8f8cdf47ef3d99b14fa7da7f4e15011c583bfd1260056704139

Height

#3,590,298

Difficulty

10.907976

Transactions

3

Size

7.87 KB

Version

2

Bits

0ae8711b

Nonce

145,750,222

Timestamp

3/8/2020, 4:00:20 PM

Confirmations

3,253,527

Merkle Root

56cc25a79c7794362dd9b73d83c795e138520358094a333c1e3b83624d2fc222
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.

3.783 × 10⁹⁵(96-digit number)
37831466091638192080…15891185143194662401
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.783 × 10⁹⁵(96-digit number)
37831466091638192080…15891185143194662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.566 × 10⁹⁵(96-digit number)
75662932183276384161…31782370286389324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.513 × 10⁹⁶(97-digit number)
15132586436655276832…63564740572778649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.026 × 10⁹⁶(97-digit number)
30265172873310553664…27129481145557299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.053 × 10⁹⁶(97-digit number)
60530345746621107329…54258962291114598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.210 × 10⁹⁷(98-digit number)
12106069149324221465…08517924582229196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.421 × 10⁹⁷(98-digit number)
24212138298648442931…17035849164458393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.842 × 10⁹⁷(98-digit number)
48424276597296885863…34071698328916787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.684 × 10⁹⁷(98-digit number)
96848553194593771726…68143396657833574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.936 × 10⁹⁸(99-digit number)
19369710638918754345…36286793315667148801
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,994,975 XPM·at block #6,843,824 · 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