Block #819,308

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/20/2014, 1:00:08 AM · Difficulty 10.9767 · 5,987,564 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ae7d344bcf6312da316360c07205ef2484e3544f1fbc3d790e9f69d56809e15b

Height

#819,308

Difficulty

10.976694

Transactions

6

Size

1.96 KB

Version

2

Bits

0afa08a4

Nonce

690,958,148

Timestamp

11/20/2014, 1:00:08 AM

Confirmations

5,987,564

Merkle Root

9adb22113858aded8cfe377f15bd33b31b7da82d9bed9fd72387769991cb4375
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.027 × 10⁹⁵(96-digit number)
80271494739348424186…21996755452112340021
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.027 × 10⁹⁵(96-digit number)
80271494739348424186…21996755452112340021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.605 × 10⁹⁶(97-digit number)
16054298947869684837…43993510904224680041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.210 × 10⁹⁶(97-digit number)
32108597895739369674…87987021808449360081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.421 × 10⁹⁶(97-digit number)
64217195791478739348…75974043616898720161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.284 × 10⁹⁷(98-digit number)
12843439158295747869…51948087233797440321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.568 × 10⁹⁷(98-digit number)
25686878316591495739…03896174467594880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.137 × 10⁹⁷(98-digit number)
51373756633182991479…07792348935189761281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.027 × 10⁹⁸(99-digit number)
10274751326636598295…15584697870379522561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.054 × 10⁹⁸(99-digit number)
20549502653273196591…31169395740759045121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.109 × 10⁹⁸(99-digit number)
41099005306546393183…62338791481518090241
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,699,083 XPM·at block #6,806,871 · 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.

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