Block #855,688

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 1:10:23 PM · Difficulty 10.9682 · 5,971,504 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
38b328b213f229726b9690db72ebe2c30cb928323b6dc6fef454e952a608187b

Height

#855,688

Difficulty

10.968234

Transactions

6

Size

1.59 KB

Version

2

Bits

0af7de30

Nonce

1,095,576,840

Timestamp

12/16/2014, 1:10:23 PM

Confirmations

5,971,504

Merkle Root

20202d8b1b74be8917c2313b6ee4e6c3af509d011fd75e0db8a68455e20cff78
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.776 × 10⁹⁵(96-digit number)
17763044636296866162…14656581781531472641
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.776 × 10⁹⁵(96-digit number)
17763044636296866162…14656581781531472641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.552 × 10⁹⁵(96-digit number)
35526089272593732325…29313163563062945281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.105 × 10⁹⁵(96-digit number)
71052178545187464651…58626327126125890561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.421 × 10⁹⁶(97-digit number)
14210435709037492930…17252654252251781121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.842 × 10⁹⁶(97-digit number)
28420871418074985860…34505308504503562241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.684 × 10⁹⁶(97-digit number)
56841742836149971721…69010617009007124481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.136 × 10⁹⁷(98-digit number)
11368348567229994344…38021234018014248961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.273 × 10⁹⁷(98-digit number)
22736697134459988688…76042468036028497921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.547 × 10⁹⁷(98-digit number)
45473394268919977376…52084936072056995841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.094 × 10⁹⁷(98-digit number)
90946788537839954753…04169872144113991681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,861,631 XPM·at block #6,827,191 · 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