Block #852,099

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 7:58:19 PM · Difficulty 10.9701 · 5,987,506 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
110a40ced503803cd6734f57db1df9108e924f326eeaf96412a1a345ea2ecffe

Height

#852,099

Difficulty

10.970100

Transactions

10

Size

2.30 KB

Version

2

Bits

0af85877

Nonce

130,450,913

Timestamp

12/13/2014, 7:58:19 PM

Confirmations

5,987,506

Merkle Root

f0372ac1bbc3e47c4d4682f917a1b18bba9b7ec17e4d9f88e7b7db3dcba5df7f
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.147 × 10⁹⁵(96-digit number)
51477915690596769242…68591952647626573781
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.147 × 10⁹⁵(96-digit number)
51477915690596769242…68591952647626573781
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.029 × 10⁹⁶(97-digit number)
10295583138119353848…37183905295253147561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.059 × 10⁹⁶(97-digit number)
20591166276238707697…74367810590506295121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.118 × 10⁹⁶(97-digit number)
41182332552477415394…48735621181012590241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.236 × 10⁹⁶(97-digit number)
82364665104954830788…97471242362025180481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.647 × 10⁹⁷(98-digit number)
16472933020990966157…94942484724050360961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.294 × 10⁹⁷(98-digit number)
32945866041981932315…89884969448100721921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.589 × 10⁹⁷(98-digit number)
65891732083963864630…79769938896201443841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.317 × 10⁹⁸(99-digit number)
13178346416792772926…59539877792402887681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.635 × 10⁹⁸(99-digit number)
26356692833585545852…19079755584805775361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.271 × 10⁹⁸(99-digit number)
52713385667171091704…38159511169611550721
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,961,129 XPM·at block #6,839,604 · 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