Block #2,064,717

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2017, 2:30:28 PM · Difficulty 10.8458 · 4,774,298 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e52356b26c2fa1f21cfca16dcb8832f9ed179595066606d8fd80486ffd090288

Height

#2,064,717

Difficulty

10.845834

Transactions

2

Size

725 B

Version

2

Bits

0ad8889c

Nonce

289,730,912

Timestamp

4/10/2017, 2:30:28 PM

Confirmations

4,774,298

Merkle Root

85827da6363d856a1f50c2d469ca6fb28ca0384fe469cb54947c3e8b51b50796
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.

8.697 × 10⁹⁵(96-digit number)
86970245585815170884…50575059307033139201
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
8.697 × 10⁹⁵(96-digit number)
86970245585815170884…50575059307033139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.739 × 10⁹⁶(97-digit number)
17394049117163034176…01150118614066278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.478 × 10⁹⁶(97-digit number)
34788098234326068353…02300237228132556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.957 × 10⁹⁶(97-digit number)
69576196468652136707…04600474456265113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.391 × 10⁹⁷(98-digit number)
13915239293730427341…09200948912530227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.783 × 10⁹⁷(98-digit number)
27830478587460854683…18401897825060454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.566 × 10⁹⁷(98-digit number)
55660957174921709366…36803795650120908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.113 × 10⁹⁸(99-digit number)
11132191434984341873…73607591300241817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.226 × 10⁹⁸(99-digit number)
22264382869968683746…47215182600483635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.452 × 10⁹⁸(99-digit number)
44528765739937367492…94430365200967270401
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,956,388 XPM·at block #6,839,014 · 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