Block #851,739

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 1:06:14 PM · Difficulty 10.9704 · 5,988,522 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
56b0b86528b028d5848dbe10ae4ba9071ecaf13527ffc663eb9b4ba845a38836

Height

#851,739

Difficulty

10.970399

Transactions

2

Size

468 B

Version

2

Bits

0af86c16

Nonce

170,150,623

Timestamp

12/13/2014, 1:06:14 PM

Confirmations

5,988,522

Merkle Root

750aa89fbf4051ccc6bff68f2c861fb05a0a6bacde4b43015876aa7315422028
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.

8.969 × 10⁹⁵(96-digit number)
89693069849656315576…83513843571381966081
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
8.969 × 10⁹⁵(96-digit number)
89693069849656315576…83513843571381966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.793 × 10⁹⁶(97-digit number)
17938613969931263115…67027687142763932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.587 × 10⁹⁶(97-digit number)
35877227939862526230…34055374285527864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.175 × 10⁹⁶(97-digit number)
71754455879725052460…68110748571055728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.435 × 10⁹⁷(98-digit number)
14350891175945010492…36221497142111457281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.870 × 10⁹⁷(98-digit number)
28701782351890020984…72442994284222914561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.740 × 10⁹⁷(98-digit number)
57403564703780041968…44885988568445829121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.148 × 10⁹⁸(99-digit number)
11480712940756008393…89771977136891658241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.296 × 10⁹⁸(99-digit number)
22961425881512016787…79543954273783316481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.592 × 10⁹⁸(99-digit number)
45922851763024033575…59087908547566632961
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,966,401 XPM·at block #6,840,260 · 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