Block #2,125,316

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2017, 12:07:00 PM · Difficulty 10.9187 · 4,708,527 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd12311838fd36b79d7c8536e289bc778562db79f2ef3a1caf56109f625b09be

Height

#2,125,316

Difficulty

10.918675

Transactions

42

Size

12.65 KB

Version

2

Bits

0aeb2e46

Nonce

35,145,027

Timestamp

5/20/2017, 12:07:00 PM

Confirmations

4,708,527

Merkle Root

c96c8735ec07a8e139b8d4a49a4b1792915d17dd998eefe7046720fb3f6a6835
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.971 × 10⁹¹(92-digit number)
69713305343380868262…38147745189896201681
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.971 × 10⁹¹(92-digit number)
69713305343380868262…38147745189896201681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.394 × 10⁹²(93-digit number)
13942661068676173652…76295490379792403361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.788 × 10⁹²(93-digit number)
27885322137352347304…52590980759584806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.577 × 10⁹²(93-digit number)
55770644274704694609…05181961519169613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.115 × 10⁹³(94-digit number)
11154128854940938921…10363923038339226881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.230 × 10⁹³(94-digit number)
22308257709881877843…20727846076678453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.461 × 10⁹³(94-digit number)
44616515419763755687…41455692153356907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.923 × 10⁹³(94-digit number)
89233030839527511375…82911384306713815041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.784 × 10⁹⁴(95-digit number)
17846606167905502275…65822768613427630081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.569 × 10⁹⁴(95-digit number)
35693212335811004550…31645537226855260161
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,914,974 XPM·at block #6,833,842 · 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