Block #847,314

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2014, 6:23:42 AM · Difficulty 10.9720 · 5,994,033 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
24b11a628a7e2965cfb20bd98b50319a535dcad62422cf305202267efd665e03

Height

#847,314

Difficulty

10.971952

Transactions

9

Size

2.31 KB

Version

2

Bits

0af8d1d6

Nonce

808,914,395

Timestamp

12/10/2014, 6:23:42 AM

Confirmations

5,994,033

Merkle Root

f594ea3b4ee69d74b18be1a5b4fc3549b63e2a2b8337023224b3372f19c84427
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.269 × 10⁹⁷(98-digit number)
22695143868223853833…18210729124693224321
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.269 × 10⁹⁷(98-digit number)
22695143868223853833…18210729124693224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.539 × 10⁹⁷(98-digit number)
45390287736447707666…36421458249386448641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.078 × 10⁹⁷(98-digit number)
90780575472895415333…72842916498772897281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.815 × 10⁹⁸(99-digit number)
18156115094579083066…45685832997545794561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.631 × 10⁹⁸(99-digit number)
36312230189158166133…91371665995091589121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.262 × 10⁹⁸(99-digit number)
72624460378316332266…82743331990183178241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.452 × 10⁹⁹(100-digit number)
14524892075663266453…65486663980366356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.904 × 10⁹⁹(100-digit number)
29049784151326532906…30973327960732712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.809 × 10⁹⁹(100-digit number)
58099568302653065813…61946655921465425921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.161 × 10¹⁰⁰(101-digit number)
11619913660530613162…23893311842930851841
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,975,143 XPM·at block #6,841,346 · 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