Block #716,547

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2014, 5:29:14 PM · Difficulty 10.9525 · 6,101,162 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ad4d8387bf131e3273b7746ee633e09be8b4bf851cbb870f17cab2d65a16c4d

Height

#716,547

Difficulty

10.952504

Transactions

9

Size

2.69 KB

Version

2

Bits

0af3d74b

Nonce

95,254,941

Timestamp

9/11/2014, 5:29:14 PM

Confirmations

6,101,162

Merkle Root

22f961b7294c0cd4556e32ba7766e15977c673ba5211fc34545561351a5d663e
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.

4.387 × 10⁹⁸(99-digit number)
43872828007146933805…01696447518986526721
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
4.387 × 10⁹⁸(99-digit number)
43872828007146933805…01696447518986526721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.774 × 10⁹⁸(99-digit number)
87745656014293867611…03392895037973053441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.754 × 10⁹⁹(100-digit number)
17549131202858773522…06785790075946106881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.509 × 10⁹⁹(100-digit number)
35098262405717547044…13571580151892213761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.019 × 10⁹⁹(100-digit number)
70196524811435094089…27143160303784427521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.403 × 10¹⁰⁰(101-digit number)
14039304962287018817…54286320607568855041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.807 × 10¹⁰⁰(101-digit number)
28078609924574037635…08572641215137710081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.615 × 10¹⁰⁰(101-digit number)
56157219849148075271…17145282430275420161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.123 × 10¹⁰¹(102-digit number)
11231443969829615054…34290564860550840321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.246 × 10¹⁰¹(102-digit number)
22462887939659230108…68581129721101680641
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,785,731 XPM·at block #6,817,708 · 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