Block #857,345

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 6:48:57 PM · Difficulty 10.9675 · 5,984,804 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7aaa6a6163973a37bfd1e531ffed656ca3b93a60009f7e192a7bdf5ceddf1f9

Height

#857,345

Difficulty

10.967491

Transactions

2

Size

458 B

Version

2

Bits

0af7ad77

Nonce

505,182,589

Timestamp

12/17/2014, 6:48:57 PM

Confirmations

5,984,804

Merkle Root

6b5a87cbbb7d797bcd0bb575e93e746f586b490794e73a14b18c38b8d8d258d5
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.858 × 10⁹⁴(95-digit number)
18581592375113406059…50698650550503300481
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.858 × 10⁹⁴(95-digit number)
18581592375113406059…50698650550503300481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.716 × 10⁹⁴(95-digit number)
37163184750226812119…01397301101006600961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.432 × 10⁹⁴(95-digit number)
74326369500453624239…02794602202013201921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.486 × 10⁹⁵(96-digit number)
14865273900090724847…05589204404026403841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.973 × 10⁹⁵(96-digit number)
29730547800181449695…11178408808052807681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.946 × 10⁹⁵(96-digit number)
59461095600362899391…22356817616105615361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.189 × 10⁹⁶(97-digit number)
11892219120072579878…44713635232211230721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.378 × 10⁹⁶(97-digit number)
23784438240145159756…89427270464422461441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.756 × 10⁹⁶(97-digit number)
47568876480290319513…78854540928844922881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.513 × 10⁹⁶(97-digit number)
95137752960580639026…57709081857689845761
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,981,581 XPM·at block #6,842,148 · 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