Block #3,111,082

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/26/2019, 12:52:15 PM · Difficulty 11.2357 · 3,732,744 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ab4f7a454c6411780404d6af97b83a2fc702b63a3e435b1c454c1e77b9d9b10

Height

#3,111,082

Difficulty

11.235691

Transactions

4

Size

1.82 KB

Version

2

Bits

0b3c5647

Nonce

608,495,568

Timestamp

3/26/2019, 12:52:15 PM

Confirmations

3,732,744

Merkle Root

e3559d3cdeb5631c502c67e3f6f8abc777f825d29104c721d5d50703e89a7bf4
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.

5.616 × 10⁹⁵(96-digit number)
56168075488211219461…74914257062211485441
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
5.616 × 10⁹⁵(96-digit number)
56168075488211219461…74914257062211485441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.123 × 10⁹⁶(97-digit number)
11233615097642243892…49828514124422970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.246 × 10⁹⁶(97-digit number)
22467230195284487784…99657028248845941761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.493 × 10⁹⁶(97-digit number)
44934460390568975569…99314056497691883521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.986 × 10⁹⁶(97-digit number)
89868920781137951138…98628112995383767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.797 × 10⁹⁷(98-digit number)
17973784156227590227…97256225990767534081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.594 × 10⁹⁷(98-digit number)
35947568312455180455…94512451981535068161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.189 × 10⁹⁷(98-digit number)
71895136624910360911…89024903963070136321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.437 × 10⁹⁸(99-digit number)
14379027324982072182…78049807926140272641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.875 × 10⁹⁸(99-digit number)
28758054649964144364…56099615852280545281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.751 × 10⁹⁸(99-digit number)
57516109299928288728…12199231704561090561
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,994,983 XPM·at block #6,843,825 · 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