Block #685,402

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2014, 6:37:37 PM · Difficulty 10.9557 · 6,121,437 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
47ca6d19f6e0d9a71fb56a642d33d88ff73d114ca2f0d42e84b6fe766379f4b2

Height

#685,402

Difficulty

10.955683

Transactions

6

Size

2.21 KB

Version

2

Bits

0af4a79f

Nonce

606,682,117

Timestamp

8/20/2014, 6:37:37 PM

Confirmations

6,121,437

Merkle Root

2127affadc0079e9f6765a167255508a308bf0bc2d5432edb9b9266c4b7183ef
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.315 × 10⁹⁶(97-digit number)
43151001976309540444…72357379928460216321
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.315 × 10⁹⁶(97-digit number)
43151001976309540444…72357379928460216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.630 × 10⁹⁶(97-digit number)
86302003952619080888…44714759856920432641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.726 × 10⁹⁷(98-digit number)
17260400790523816177…89429519713840865281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.452 × 10⁹⁷(98-digit number)
34520801581047632355…78859039427681730561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.904 × 10⁹⁷(98-digit number)
69041603162095264710…57718078855363461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.380 × 10⁹⁸(99-digit number)
13808320632419052942…15436157710726922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.761 × 10⁹⁸(99-digit number)
27616641264838105884…30872315421453844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.523 × 10⁹⁸(99-digit number)
55233282529676211768…61744630842907688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.104 × 10⁹⁹(100-digit number)
11046656505935242353…23489261685815377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.209 × 10⁹⁹(100-digit number)
22093313011870484707…46978523371630755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.418 × 10⁹⁹(100-digit number)
44186626023740969414…93957046743261511681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,698,815 XPM·at block #6,806,838 · 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