Block #3,106,170

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2019, 4:43:12 AM · Difficulty 11.2199 · 3,738,998 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
71eb2a00678d39e3e0b995da45152e5c3ef4619a829a208156d18826a1e4dfbc

Height

#3,106,170

Difficulty

11.219851

Transactions

42

Size

11.82 KB

Version

2

Bits

0b38482f

Nonce

28,001,653

Timestamp

3/23/2019, 4:43:12 AM

Confirmations

3,738,998

Merkle Root

793277c158aead72d42e175aa9605eca6817cd385acd68dffffa015110b72f43
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.

2.785 × 10⁹⁷(98-digit number)
27857453684175767723…87788042452572774401
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
2.785 × 10⁹⁷(98-digit number)
27857453684175767723…87788042452572774401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.571 × 10⁹⁷(98-digit number)
55714907368351535447…75576084905145548801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.114 × 10⁹⁸(99-digit number)
11142981473670307089…51152169810291097601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.228 × 10⁹⁸(99-digit number)
22285962947340614179…02304339620582195201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.457 × 10⁹⁸(99-digit number)
44571925894681228358…04608679241164390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.914 × 10⁹⁸(99-digit number)
89143851789362456716…09217358482328780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.782 × 10⁹⁹(100-digit number)
17828770357872491343…18434716964657561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.565 × 10⁹⁹(100-digit number)
35657540715744982686…36869433929315123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.131 × 10⁹⁹(100-digit number)
71315081431489965373…73738867858630246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.426 × 10¹⁰⁰(101-digit number)
14263016286297993074…47477735717260492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.852 × 10¹⁰⁰(101-digit number)
28526032572595986149…94955471434520985601
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:58,005,774 XPM·at block #6,845,167 · 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