Block #805,821

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/10/2014, 9:43:37 PM · Difficulty 10.9747 · 6,012,017 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
54899191887b9786b9b1304c67bd3c9ded12778db96e577c4a0b3d6f76c33034

Height

#805,821

Difficulty

10.974690

Transactions

4

Size

849 B

Version

2

Bits

0af9854d

Nonce

236,029,718

Timestamp

11/10/2014, 9:43:37 PM

Confirmations

6,012,017

Merkle Root

5f086015586a33b88b1febf6321459b818dad47be5ecd45054ae3c4b73fbe6dd
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.909 × 10⁹³(94-digit number)
29093717690342705776…17453572831140178301
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.909 × 10⁹³(94-digit number)
29093717690342705776…17453572831140178301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.818 × 10⁹³(94-digit number)
58187435380685411552…34907145662280356601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.163 × 10⁹⁴(95-digit number)
11637487076137082310…69814291324560713201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.327 × 10⁹⁴(95-digit number)
23274974152274164620…39628582649121426401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.654 × 10⁹⁴(95-digit number)
46549948304548329241…79257165298242852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.309 × 10⁹⁴(95-digit number)
93099896609096658483…58514330596485705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.861 × 10⁹⁵(96-digit number)
18619979321819331696…17028661192971411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.723 × 10⁹⁵(96-digit number)
37239958643638663393…34057322385942822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.447 × 10⁹⁵(96-digit number)
74479917287277326786…68114644771885644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.489 × 10⁹⁶(97-digit number)
14895983457455465357…36229289543771289601
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,786,768 XPM·at block #6,817,837 · 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