Block #2,311,165

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/27/2017, 8:41:02 AM · Difficulty 10.9071 · 4,520,643 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eea9b4cfbac8d19a01fbf63c1292666c115facd56fb169c39b0e38372539d1ea

Height

#2,311,165

Difficulty

10.907112

Transactions

5

Size

5.67 KB

Version

2

Bits

0ae8387e

Nonce

274,760,626

Timestamp

9/27/2017, 8:41:02 AM

Confirmations

4,520,643

Merkle Root

b34f07f93def31177652cc65909fc8ee11866963e862326680d0cb113d2e44e2
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.096 × 10⁹⁵(96-digit number)
20962066764665679118…28440179153123014721
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.096 × 10⁹⁵(96-digit number)
20962066764665679118…28440179153123014721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.192 × 10⁹⁵(96-digit number)
41924133529331358236…56880358306246029441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.384 × 10⁹⁵(96-digit number)
83848267058662716473…13760716612492058881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.676 × 10⁹⁶(97-digit number)
16769653411732543294…27521433224984117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.353 × 10⁹⁶(97-digit number)
33539306823465086589…55042866449968235521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.707 × 10⁹⁶(97-digit number)
67078613646930173179…10085732899936471041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.341 × 10⁹⁷(98-digit number)
13415722729386034635…20171465799872942081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.683 × 10⁹⁷(98-digit number)
26831445458772069271…40342931599745884161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.366 × 10⁹⁷(98-digit number)
53662890917544138543…80685863199491768321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.073 × 10⁹⁸(99-digit number)
10732578183508827708…61371726398983536641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,898,579 XPM·at block #6,831,807 · 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