Block #845,403

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 8:34:30 PM · Difficulty 10.9726 · 5,996,152 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9c8d2172a16691c6ba711797b2d8bbdbdefd8077d4f5fa94258a311db537585

Height

#845,403

Difficulty

10.972551

Transactions

9

Size

2.00 KB

Version

2

Bits

0af8f913

Nonce

15,548

Timestamp

12/8/2014, 8:34:30 PM

Confirmations

5,996,152

Merkle Root

4f64b32fad544b0459cf2121e8e42fa7e23c31af2832b67e6ad8f5f1724edb96
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.247 × 10⁹⁹(100-digit number)
92479811363351852602…60140001024018815281
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.247 × 10⁹⁹(100-digit number)
92479811363351852602…60140001024018815281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.849 × 10¹⁰⁰(101-digit number)
18495962272670370520…20280002048037630561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.699 × 10¹⁰⁰(101-digit number)
36991924545340741040…40560004096075261121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.398 × 10¹⁰⁰(101-digit number)
73983849090681482081…81120008192150522241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.479 × 10¹⁰¹(102-digit number)
14796769818136296416…62240016384301044481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.959 × 10¹⁰¹(102-digit number)
29593539636272592832…24480032768602088961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.918 × 10¹⁰¹(102-digit number)
59187079272545185665…48960065537204177921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.183 × 10¹⁰²(103-digit number)
11837415854509037133…97920131074408355841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.367 × 10¹⁰²(103-digit number)
23674831709018074266…95840262148816711681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.734 × 10¹⁰²(103-digit number)
47349663418036148532…91680524297633423361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.469 × 10¹⁰²(103-digit number)
94699326836072297064…83361048595266846721
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,976,825 XPM·at block #6,841,554 · 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