Block #793,849

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/2/2014, 1:52:08 PM · Difficulty 10.9744 · 6,014,015 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0ffedc2ce1e6dee01bef11a25d1a3871c88e6e18e0ebce71887136231ec797e2

Height

#793,849

Difficulty

10.974425

Transactions

5

Size

1.08 KB

Version

2

Bits

0af973e6

Nonce

379,748,313

Timestamp

11/2/2014, 1:52:08 PM

Confirmations

6,014,015

Merkle Root

97013cb5b7e3756a9f8cccd3c4cd5e74311d976296a2a989789f2929b242363c
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.

9.114 × 10⁹⁵(96-digit number)
91143671690279813585…41516096096242617161
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
9.114 × 10⁹⁵(96-digit number)
91143671690279813585…41516096096242617161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.822 × 10⁹⁶(97-digit number)
18228734338055962717…83032192192485234321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.645 × 10⁹⁶(97-digit number)
36457468676111925434…66064384384970468641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.291 × 10⁹⁶(97-digit number)
72914937352223850868…32128768769940937281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.458 × 10⁹⁷(98-digit number)
14582987470444770173…64257537539881874561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.916 × 10⁹⁷(98-digit number)
29165974940889540347…28515075079763749121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.833 × 10⁹⁷(98-digit number)
58331949881779080694…57030150159527498241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.166 × 10⁹⁸(99-digit number)
11666389976355816138…14060300319054996481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.333 × 10⁹⁸(99-digit number)
23332779952711632277…28120600638109992961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.666 × 10⁹⁸(99-digit number)
46665559905423264555…56241201276219985921
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,706,952 XPM·at block #6,807,863 · 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