Block #2,074,186

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2017, 9:46:59 AM · Difficulty 10.8359 · 4,768,905 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b7f7d2c86a9759789dc95dfed5eb2bf4fc88026ecfe45659540d26ebf8a8086d

Height

#2,074,186

Difficulty

10.835875

Transactions

3

Size

1.94 KB

Version

2

Bits

0ad5fbe0

Nonce

75,732,762

Timestamp

4/17/2017, 9:46:59 AM

Confirmations

4,768,905

Merkle Root

a81c7263deeb20d7d171b1c2d19e625df4964f57de4ca17256bd1c511b0cd627
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.860 × 10⁹²(93-digit number)
68608854626629240159…81472474312539470281
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.860 × 10⁹²(93-digit number)
68608854626629240159…81472474312539470281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.372 × 10⁹³(94-digit number)
13721770925325848031…62944948625078940561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.744 × 10⁹³(94-digit number)
27443541850651696063…25889897250157881121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.488 × 10⁹³(94-digit number)
54887083701303392127…51779794500315762241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.097 × 10⁹⁴(95-digit number)
10977416740260678425…03559589000631524481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.195 × 10⁹⁴(95-digit number)
21954833480521356851…07119178001263048961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.390 × 10⁹⁴(95-digit number)
43909666961042713702…14238356002526097921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.781 × 10⁹⁴(95-digit number)
87819333922085427404…28476712005052195841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.756 × 10⁹⁵(96-digit number)
17563866784417085480…56953424010104391681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.512 × 10⁹⁵(96-digit number)
35127733568834170961…13906848020208783361
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,989,090 XPM·at block #6,843,090 · 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