Block #849,379

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2014, 6:44:37 PM · Difficulty 10.9714 · 5,993,409 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f2e22ef1bd41246e4acc8207fc8b16ebfc62f6a85ae3ae0e19762b0631a1423d

Height

#849,379

Difficulty

10.971359

Transactions

15

Size

3.49 KB

Version

2

Bits

0af8aaf9

Nonce

229,949,531

Timestamp

12/11/2014, 6:44:37 PM

Confirmations

5,993,409

Merkle Root

152b3f865f3c7cb3932cf950542a8b693cb7d1afbab55a55843186e1c203e7e9
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.010 × 10⁹⁶(97-digit number)
20101385667126571109…36248406631197188401
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.010 × 10⁹⁶(97-digit number)
20101385667126571109…36248406631197188401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.020 × 10⁹⁶(97-digit number)
40202771334253142218…72496813262394376801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.040 × 10⁹⁶(97-digit number)
80405542668506284437…44993626524788753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.608 × 10⁹⁷(98-digit number)
16081108533701256887…89987253049577507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.216 × 10⁹⁷(98-digit number)
32162217067402513774…79974506099155014401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.432 × 10⁹⁷(98-digit number)
64324434134805027549…59949012198310028801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.286 × 10⁹⁸(99-digit number)
12864886826961005509…19898024396620057601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.572 × 10⁹⁸(99-digit number)
25729773653922011019…39796048793240115201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.145 × 10⁹⁸(99-digit number)
51459547307844022039…79592097586480230401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.029 × 10⁹⁹(100-digit number)
10291909461568804407…59184195172960460801
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,986,645 XPM·at block #6,842,787 · 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