Block #3,539,062

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2020, 7:23:41 PM · Difficulty 10.9349 · 3,288,093 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6bdc5a14fa48eaee81ee680a6d8f6660d36c3b7048d5b5c603ecce72c1971e06

Height

#3,539,062

Difficulty

10.934904

Transactions

2

Size

1.14 KB

Version

2

Bits

0aef55e6

Nonce

1,124,782,121

Timestamp

1/31/2020, 7:23:41 PM

Confirmations

3,288,093

Merkle Root

551db1f1a1184330f9a3bfc8c7a0f64db3ba7333404620780b5c87e9668f11c7
Transactions (2)
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.

8.281 × 10⁹⁵(96-digit number)
82815036228612150890…98649002174199461121
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
8.281 × 10⁹⁵(96-digit number)
82815036228612150890…98649002174199461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.656 × 10⁹⁶(97-digit number)
16563007245722430178…97298004348398922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.312 × 10⁹⁶(97-digit number)
33126014491444860356…94596008696797844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.625 × 10⁹⁶(97-digit number)
66252028982889720712…89192017393595688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.325 × 10⁹⁷(98-digit number)
13250405796577944142…78384034787191377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.650 × 10⁹⁷(98-digit number)
26500811593155888285…56768069574382755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.300 × 10⁹⁷(98-digit number)
53001623186311776570…13536139148765511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.060 × 10⁹⁸(99-digit number)
10600324637262355314…27072278297531023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.120 × 10⁹⁸(99-digit number)
21200649274524710628…54144556595062046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.240 × 10⁹⁸(99-digit number)
42401298549049421256…08289113190124093441
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,861,424 XPM·at block #6,827,154 · 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