Block #856,030

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 7:10:04 PM · Difficulty 10.9681 · 5,980,645 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
36e731a04f11dc6524cf6b1f28a6924bcb5fe565e618a5f544d4b5da496a06cf

Height

#856,030

Difficulty

10.968118

Transactions

3

Size

660 B

Version

2

Bits

0af7d698

Nonce

16,175,389

Timestamp

12/16/2014, 7:10:04 PM

Confirmations

5,980,645

Merkle Root

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

3.531 × 10⁹⁵(96-digit number)
35315914667097702280…24854290207152976961
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
3.531 × 10⁹⁵(96-digit number)
35315914667097702280…24854290207152976961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.063 × 10⁹⁵(96-digit number)
70631829334195404561…49708580414305953921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.412 × 10⁹⁶(97-digit number)
14126365866839080912…99417160828611907841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.825 × 10⁹⁶(97-digit number)
28252731733678161824…98834321657223815681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.650 × 10⁹⁶(97-digit number)
56505463467356323649…97668643314447631361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.130 × 10⁹⁷(98-digit number)
11301092693471264729…95337286628895262721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.260 × 10⁹⁷(98-digit number)
22602185386942529459…90674573257790525441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.520 × 10⁹⁷(98-digit number)
45204370773885058919…81349146515581050881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.040 × 10⁹⁷(98-digit number)
90408741547770117839…62698293031162101761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.808 × 10⁹⁸(99-digit number)
18081748309554023567…25396586062324203521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.616 × 10⁹⁸(99-digit number)
36163496619108047135…50793172124648407041
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,937,679 XPM·at block #6,836,674 · 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