Block #3,140,526

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2019, 2:41:33 PM · Difficulty 11.3139 · 3,702,500 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
65b8fbd0eab7870e22f756e57c5b3d1007c6425088c69bb42cb282e2c056ae7b

Height

#3,140,526

Difficulty

11.313934

Transactions

23

Size

7.29 KB

Version

2

Bits

0b505dfe

Nonce

553,618,650

Timestamp

4/15/2019, 2:41:33 PM

Confirmations

3,702,500

Merkle Root

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

6.042 × 10⁹²(93-digit number)
60427628321060076051…59319430446863165601
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
6.042 × 10⁹²(93-digit number)
60427628321060076051…59319430446863165601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.208 × 10⁹³(94-digit number)
12085525664212015210…18638860893726331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.417 × 10⁹³(94-digit number)
24171051328424030420…37277721787452662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.834 × 10⁹³(94-digit number)
48342102656848060841…74555443574905324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.668 × 10⁹³(94-digit number)
96684205313696121682…49110887149810649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.933 × 10⁹⁴(95-digit number)
19336841062739224336…98221774299621299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.867 × 10⁹⁴(95-digit number)
38673682125478448672…96443548599242598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.734 × 10⁹⁴(95-digit number)
77347364250956897345…92887097198485196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.546 × 10⁹⁵(96-digit number)
15469472850191379469…85774194396970393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.093 × 10⁹⁵(96-digit number)
30938945700382758938…71548388793940787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.187 × 10⁹⁵(96-digit number)
61877891400765517876…43096777587881574401
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,988,562 XPM·at block #6,843,025 · 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