Block #682,419

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/18/2014, 6:31:34 AM · Difficulty 10.9607 · 6,124,048 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da1ec9a986c904234279171aa6f5e1075af8aa08abac49813c851e1929af4d7a

Height

#682,419

Difficulty

10.960737

Transactions

3

Size

657 B

Version

2

Bits

0af5f2d4

Nonce

67,396,955

Timestamp

8/18/2014, 6:31:34 AM

Confirmations

6,124,048

Merkle Root

def39bcc8f2d78e63653643f0178e7a6fc427682e4b97c1d94356d4ea405552a
Transactions (3)
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.

2.473 × 10⁹⁶(97-digit number)
24732323836835389638…15732144559185830081
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
2.473 × 10⁹⁶(97-digit number)
24732323836835389638…15732144559185830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.946 × 10⁹⁶(97-digit number)
49464647673670779276…31464289118371660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.892 × 10⁹⁶(97-digit number)
98929295347341558553…62928578236743320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.978 × 10⁹⁷(98-digit number)
19785859069468311710…25857156473486640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.957 × 10⁹⁷(98-digit number)
39571718138936623421…51714312946973281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.914 × 10⁹⁷(98-digit number)
79143436277873246842…03428625893946562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.582 × 10⁹⁸(99-digit number)
15828687255574649368…06857251787893125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.165 × 10⁹⁸(99-digit number)
31657374511149298737…13714503575786250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.331 × 10⁹⁸(99-digit number)
63314749022298597474…27429007151572500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.266 × 10⁹⁹(100-digit number)
12662949804459719494…54858014303145000961
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,695,829 XPM·at block #6,806,466 · 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