Block #852,016

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 6:23:17 PM · Difficulty 10.9702 · 5,974,717 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b4e49e35d9b391dfaaaaa4b67c0991918433cf12cb58d9108629a7fdac11900

Height

#852,016

Difficulty

10.970167

Transactions

3

Size

658 B

Version

2

Bits

0af85cdb

Nonce

134,406,632

Timestamp

12/13/2014, 6:23:17 PM

Confirmations

5,974,717

Merkle Root

f916dc83ddef86c6b9990f4f7ace5b039220c566bc5b78eddad5cec7ae5298eb
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.473 × 10⁹⁶(97-digit number)
94731484447076306595…87467794200363048961
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.473 × 10⁹⁶(97-digit number)
94731484447076306595…87467794200363048961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.894 × 10⁹⁷(98-digit number)
18946296889415261319…74935588400726097921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.789 × 10⁹⁷(98-digit number)
37892593778830522638…49871176801452195841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.578 × 10⁹⁷(98-digit number)
75785187557661045276…99742353602904391681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.515 × 10⁹⁸(99-digit number)
15157037511532209055…99484707205808783361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.031 × 10⁹⁸(99-digit number)
30314075023064418110…98969414411617566721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.062 × 10⁹⁸(99-digit number)
60628150046128836221…97938828823235133441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.212 × 10⁹⁹(100-digit number)
12125630009225767244…95877657646470266881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.425 × 10⁹⁹(100-digit number)
24251260018451534488…91755315292940533761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.850 × 10⁹⁹(100-digit number)
48502520036903068976…83510630585881067521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.700 × 10⁹⁹(100-digit number)
97005040073806137953…67021261171762135041
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,858,018 XPM·at block #6,826,732 · 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