Block #3,087,341

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2019, 8:24:37 PM · Difficulty 11.0384 · 3,752,866 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d839e8e1215c90a5bde3cda0997ff63c2cf3d8be6b6c4fef924a60964ad84fe8

Height

#3,087,341

Difficulty

11.038394

Transactions

2

Size

1.57 KB

Version

2

Bits

0b09d433

Nonce

1,266,160,858

Timestamp

3/10/2019, 8:24:37 PM

Confirmations

3,752,866

Merkle Root

8583fa920a53ec65db6f3ecb4599e62299c7973cc24aacff25d6f9c1facc4977
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.

3.051 × 10⁹⁵(96-digit number)
30519759473847460687…91892433168278477441
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.051 × 10⁹⁵(96-digit number)
30519759473847460687…91892433168278477441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.103 × 10⁹⁵(96-digit number)
61039518947694921374…83784866336556954881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.220 × 10⁹⁶(97-digit number)
12207903789538984274…67569732673113909761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.441 × 10⁹⁶(97-digit number)
24415807579077968549…35139465346227819521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.883 × 10⁹⁶(97-digit number)
48831615158155937099…70278930692455639041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.766 × 10⁹⁶(97-digit number)
97663230316311874199…40557861384911278081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.953 × 10⁹⁷(98-digit number)
19532646063262374839…81115722769822556161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.906 × 10⁹⁷(98-digit number)
39065292126524749679…62231445539645112321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.813 × 10⁹⁷(98-digit number)
78130584253049499359…24462891079290224641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.562 × 10⁹⁸(99-digit number)
15626116850609899871…48925782158580449281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.125 × 10⁹⁸(99-digit number)
31252233701219799743…97851564317160898561
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,965,973 XPM·at block #6,840,206 · 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