Block #3,097,575

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2019, 5:49:44 PM · Difficulty 11.0957 · 3,736,064 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0905408e2036d47432623c29eefbd32e3172d2373b13f8613edbab86564bf895

Height

#3,097,575

Difficulty

11.095664

Transactions

19

Size

4.17 KB

Version

2

Bits

0b187d73

Nonce

592,659,387

Timestamp

3/17/2019, 5:49:44 PM

Confirmations

3,736,064

Merkle Root

1c9f1646ffc4dfecef1c04e5965b741068620313e54d54d49f421dd4dda09a0d
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.

4.533 × 10⁹⁵(96-digit number)
45330333271954591036…99197072604187612161
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
4.533 × 10⁹⁵(96-digit number)
45330333271954591036…99197072604187612161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.066 × 10⁹⁵(96-digit number)
90660666543909182073…98394145208375224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.813 × 10⁹⁶(97-digit number)
18132133308781836414…96788290416750448641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.626 × 10⁹⁶(97-digit number)
36264266617563672829…93576580833500897281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.252 × 10⁹⁶(97-digit number)
72528533235127345658…87153161667001794561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.450 × 10⁹⁷(98-digit number)
14505706647025469131…74306323334003589121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.901 × 10⁹⁷(98-digit number)
29011413294050938263…48612646668007178241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.802 × 10⁹⁷(98-digit number)
58022826588101876526…97225293336014356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.160 × 10⁹⁸(99-digit number)
11604565317620375305…94450586672028712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.320 × 10⁹⁸(99-digit number)
23209130635240750610…88901173344057425921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.641 × 10⁹⁸(99-digit number)
46418261270481501221…77802346688114851841
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,913,324 XPM·at block #6,833,638 · 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