Block #685,269

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2014, 4:05:20 PM · Difficulty 10.9558 · 6,121,563 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ef4fac42f9e04ebd552252efbed06a0d64f7fd1268843ee900989d46de58a5c

Height

#685,269

Difficulty

10.955839

Transactions

2

Size

432 B

Version

2

Bits

0af4b1d5

Nonce

400,210,113

Timestamp

8/20/2014, 4:05:20 PM

Confirmations

6,121,563

Merkle Root

2adb46008943d4b5b09c1784804c91872da978c74694ad0517d60f4f69a320f2
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.553 × 10⁹⁵(96-digit number)
45535142537945159909…44304338089463254881
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.553 × 10⁹⁵(96-digit number)
45535142537945159909…44304338089463254881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.107 × 10⁹⁵(96-digit number)
91070285075890319818…88608676178926509761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.821 × 10⁹⁶(97-digit number)
18214057015178063963…77217352357853019521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.642 × 10⁹⁶(97-digit number)
36428114030356127927…54434704715706039041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.285 × 10⁹⁶(97-digit number)
72856228060712255854…08869409431412078081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.457 × 10⁹⁷(98-digit number)
14571245612142451170…17738818862824156161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.914 × 10⁹⁷(98-digit number)
29142491224284902341…35477637725648312321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.828 × 10⁹⁷(98-digit number)
58284982448569804683…70955275451296624641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.165 × 10⁹⁸(99-digit number)
11656996489713960936…41910550902593249281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.331 × 10⁹⁸(99-digit number)
23313992979427921873…83821101805186498561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.662 × 10⁹⁸(99-digit number)
46627985958855843747…67642203610372997121
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,760 XPM·at block #6,806,831 · 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