Block #840,906

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2014, 11:52:25 AM · Difficulty 10.9742 · 6,000,967 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
88036e0b780ab34c454dc36689cbc003ef4099587a793ed10ce2de0b9b26b096

Height

#840,906

Difficulty

10.974228

Transactions

3

Size

659 B

Version

2

Bits

0af966fe

Nonce

684,296,954

Timestamp

12/5/2014, 11:52:25 AM

Confirmations

6,000,967

Merkle Root

3b1eaef16fd48058aa45591e0e4493e5967981d21c1f8713b81c0033cf4ffb9c
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.

1.378 × 10⁹⁶(97-digit number)
13784843790791551334…59436235469818849281
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
1.378 × 10⁹⁶(97-digit number)
13784843790791551334…59436235469818849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.756 × 10⁹⁶(97-digit number)
27569687581583102669…18872470939637698561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.513 × 10⁹⁶(97-digit number)
55139375163166205338…37744941879275397121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.102 × 10⁹⁷(98-digit number)
11027875032633241067…75489883758550794241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.205 × 10⁹⁷(98-digit number)
22055750065266482135…50979767517101588481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.411 × 10⁹⁷(98-digit number)
44111500130532964270…01959535034203176961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.822 × 10⁹⁷(98-digit number)
88223000261065928540…03919070068406353921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.764 × 10⁹⁸(99-digit number)
17644600052213185708…07838140136812707841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.528 × 10⁹⁸(99-digit number)
35289200104426371416…15676280273625415681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.057 × 10⁹⁸(99-digit number)
70578400208852742832…31352560547250831361
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,979,359 XPM·at block #6,841,872 · 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