Block #857,780

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 2:30:59 AM · Difficulty 10.9673 · 5,986,674 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c74b300b618c7affba6f617821e836040db724843f223d231323c2bb6792a6f9

Height

#857,780

Difficulty

10.967349

Transactions

51

Size

13.40 KB

Version

2

Bits

0af7a42c

Nonce

300,533,653

Timestamp

12/18/2014, 2:30:59 AM

Confirmations

5,986,674

Merkle Root

d88e9121fb772dc4bba1fe3fc8a4ccd54cb0b43dde5fc2550d060d345cc7aca6
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.670 × 10⁹⁶(97-digit number)
36700117472398153088…88975321374328750081
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.670 × 10⁹⁶(97-digit number)
36700117472398153088…88975321374328750081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.340 × 10⁹⁶(97-digit number)
73400234944796306177…77950642748657500161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.468 × 10⁹⁷(98-digit number)
14680046988959261235…55901285497315000321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.936 × 10⁹⁷(98-digit number)
29360093977918522470…11802570994630000641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.872 × 10⁹⁷(98-digit number)
58720187955837044941…23605141989260001281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.174 × 10⁹⁸(99-digit number)
11744037591167408988…47210283978520002561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.348 × 10⁹⁸(99-digit number)
23488075182334817976…94420567957040005121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.697 × 10⁹⁸(99-digit number)
46976150364669635953…88841135914080010241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.395 × 10⁹⁸(99-digit number)
93952300729339271907…77682271828160020481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.879 × 10⁹⁹(100-digit number)
18790460145867854381…55364543656320040961
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:58,000,031 XPM·at block #6,844,453 · 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