Block #849,468

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2014, 8:14:31 PM · Difficulty 10.9714 · 5,993,513 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e771579a333c6da0506d5d957c9fb19a158349172ac9e2ef48d4cef07bfdc66

Height

#849,468

Difficulty

10.971362

Transactions

2

Size

427 B

Version

2

Bits

0af8ab29

Nonce

639,088,931

Timestamp

12/11/2014, 8:14:31 PM

Confirmations

5,993,513

Merkle Root

80eda8972fba29f6f670c7471674a257b48d38dfbd15d95aa63707f090d555ac
Transactions (2)
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.864 × 10⁹⁶(97-digit number)
98645224447957524322…83138419276416537601
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.864 × 10⁹⁶(97-digit number)
98645224447957524322…83138419276416537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.972 × 10⁹⁷(98-digit number)
19729044889591504864…66276838552833075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.945 × 10⁹⁷(98-digit number)
39458089779183009728…32553677105666150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.891 × 10⁹⁷(98-digit number)
78916179558366019457…65107354211332300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.578 × 10⁹⁸(99-digit number)
15783235911673203891…30214708422664601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.156 × 10⁹⁸(99-digit number)
31566471823346407783…60429416845329203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.313 × 10⁹⁸(99-digit number)
63132943646692815566…20858833690658406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.262 × 10⁹⁹(100-digit number)
12626588729338563113…41717667381316812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.525 × 10⁹⁹(100-digit number)
25253177458677126226…83435334762633625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.050 × 10⁹⁹(100-digit number)
50506354917354252452…66870669525267251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.010 × 10¹⁰⁰(101-digit number)
10101270983470850490…33741339050534502401
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,988,202 XPM·at block #6,842,980 · 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