Block #843,480

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 10:22:25 AM · Difficulty 10.9732 · 5,998,875 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e1fdfe21692d26acd7371ba8fd4d3a25e94bce755986e45be4e2d118492786e

Height

#843,480

Difficulty

10.973191

Transactions

16

Size

4.97 KB

Version

2

Bits

0af92305

Nonce

2,032,860,385

Timestamp

12/7/2014, 10:22:25 AM

Confirmations

5,998,875

Merkle Root

2296145228d5dfce258f0604fcd53bcd5360c16134af277248f9b922f428f155
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.754 × 10⁹³(94-digit number)
87542686576965825761…30040700755130571521
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.754 × 10⁹³(94-digit number)
87542686576965825761…30040700755130571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.750 × 10⁹⁴(95-digit number)
17508537315393165152…60081401510261143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.501 × 10⁹⁴(95-digit number)
35017074630786330304…20162803020522286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.003 × 10⁹⁴(95-digit number)
70034149261572660609…40325606041044572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.400 × 10⁹⁵(96-digit number)
14006829852314532121…80651212082089144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.801 × 10⁹⁵(96-digit number)
28013659704629064243…61302424164178288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.602 × 10⁹⁵(96-digit number)
56027319409258128487…22604848328356577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.120 × 10⁹⁶(97-digit number)
11205463881851625697…45209696656713154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.241 × 10⁹⁶(97-digit number)
22410927763703251394…90419393313426309121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.482 × 10⁹⁶(97-digit number)
44821855527406502789…80838786626852618241
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,983,247 XPM·at block #6,842,354 · 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