Block #856,133

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 8:41:50 PM · Difficulty 10.9682 · 5,984,661 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da051e472495d3dab75720ec0b86548db9b0fd8ee5dc495b14527c383c475820

Height

#856,133

Difficulty

10.968201

Transactions

9

Size

1.97 KB

Version

2

Bits

0af7dc08

Nonce

484,480,295

Timestamp

12/16/2014, 8:41:50 PM

Confirmations

5,984,661

Merkle Root

d918df436f3cdcfa037afaad77bbfbf50b7f528c1626cb25690e92dd25ef13e9
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.

1.407 × 10⁹⁵(96-digit number)
14077168697571062228…68402615652626580401
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
1.407 × 10⁹⁵(96-digit number)
14077168697571062228…68402615652626580401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.815 × 10⁹⁵(96-digit number)
28154337395142124457…36805231305253160801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.630 × 10⁹⁵(96-digit number)
56308674790284248914…73610462610506321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.126 × 10⁹⁶(97-digit number)
11261734958056849782…47220925221012643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.252 × 10⁹⁶(97-digit number)
22523469916113699565…94441850442025286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.504 × 10⁹⁶(97-digit number)
45046939832227399131…88883700884050572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.009 × 10⁹⁶(97-digit number)
90093879664454798262…77767401768101145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.801 × 10⁹⁷(98-digit number)
18018775932890959652…55534803536202291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.603 × 10⁹⁷(98-digit number)
36037551865781919305…11069607072404582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.207 × 10⁹⁷(98-digit number)
72075103731563838610…22139214144809164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.441 × 10⁹⁸(99-digit number)
14415020746312767722…44278428289618329601
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,970,699 XPM·at block #6,840,793 · 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