Block #857,062

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 1:44:39 PM · Difficulty 10.9676 · 5,949,667 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d31a727a87fbcc1f2089922baa0a0fd01a238c6602a94ad015476706d9901c8

Height

#857,062

Difficulty

10.967644

Transactions

16

Size

13.07 KB

Version

2

Bits

0af7b780

Nonce

110,006,682

Timestamp

12/17/2014, 1:44:39 PM

Confirmations

5,949,667

Merkle Root

209d035e2912e581bd5d5414782e1487a9032d2670faf68fd5c22163c2ad5f6b
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.

5.837 × 10⁹⁵(96-digit number)
58374984309153384831…43006377073855033599
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
5.837 × 10⁹⁵(96-digit number)
58374984309153384831…43006377073855033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.167 × 10⁹⁶(97-digit number)
11674996861830676966…86012754147710067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.334 × 10⁹⁶(97-digit number)
23349993723661353932…72025508295420134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.669 × 10⁹⁶(97-digit number)
46699987447322707865…44051016590840268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.339 × 10⁹⁶(97-digit number)
93399974894645415730…88102033181680537599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.867 × 10⁹⁷(98-digit number)
18679994978929083146…76204066363361075199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.735 × 10⁹⁷(98-digit number)
37359989957858166292…52408132726722150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.471 × 10⁹⁷(98-digit number)
74719979915716332584…04816265453444300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.494 × 10⁹⁸(99-digit number)
14943995983143266516…09632530906888601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.988 × 10⁹⁸(99-digit number)
29887991966286533033…19265061813777203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.977 × 10⁹⁸(99-digit number)
59775983932573066067…38530123627554406399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,697,930 XPM·at block #6,806,728 · 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.

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