Block #846,556

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2014, 5:01:29 PM · Difficulty 10.9722 · 5,986,712 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5d1a503494d017f3bad2b5752cab46a2308734059fa1242062dcef22ec33df1f

Height

#846,556

Difficulty

10.972170

Transactions

3

Size

652 B

Version

2

Bits

0af8e01e

Nonce

384,725,078

Timestamp

12/9/2014, 5:01:29 PM

Confirmations

5,986,712

Merkle Root

392e33cd4214028bd4727a677853b67d4a2bf3bd52bcc66140c1939e3268cad9
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.882 × 10⁹⁶(97-digit number)
18823325037337970396…85149946661034352641
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.882 × 10⁹⁶(97-digit number)
18823325037337970396…85149946661034352641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.764 × 10⁹⁶(97-digit number)
37646650074675940792…70299893322068705281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.529 × 10⁹⁶(97-digit number)
75293300149351881585…40599786644137410561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.505 × 10⁹⁷(98-digit number)
15058660029870376317…81199573288274821121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.011 × 10⁹⁷(98-digit number)
30117320059740752634…62399146576549642241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.023 × 10⁹⁷(98-digit number)
60234640119481505268…24798293153099284481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.204 × 10⁹⁸(99-digit number)
12046928023896301053…49596586306198568961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.409 × 10⁹⁸(99-digit number)
24093856047792602107…99193172612397137921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.818 × 10⁹⁸(99-digit number)
48187712095585204214…98386345224794275841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.637 × 10⁹⁸(99-digit number)
96375424191170408428…96772690449588551681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.927 × 10⁹⁹(100-digit number)
19275084838234081685…93545380899177103361
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,910,337 XPM·at block #6,833,267 · 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