Block #786,888

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/28/2014, 4:12:24 PM · Difficulty 10.9747 · 6,024,046 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
01a256c4f3bdd6bf3bb98568204cc6eb6b7e36bba601d9e105fd758fff31842d

Height

#786,888

Difficulty

10.974652

Transactions

8

Size

2.00 KB

Version

2

Bits

0af982cc

Nonce

1,561,975,227

Timestamp

10/28/2014, 4:12:24 PM

Confirmations

6,024,046

Merkle Root

882b315867c656f634d4ace7cd4afc505d53d4eca5cbcfbe9aef8057637384cb
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.443 × 10⁹⁴(95-digit number)
54432824768160154449…56021171012127740861
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.443 × 10⁹⁴(95-digit number)
54432824768160154449…56021171012127740861
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.088 × 10⁹⁵(96-digit number)
10886564953632030889…12042342024255481721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.177 × 10⁹⁵(96-digit number)
21773129907264061779…24084684048510963441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.354 × 10⁹⁵(96-digit number)
43546259814528123559…48169368097021926881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.709 × 10⁹⁵(96-digit number)
87092519629056247119…96338736194043853761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.741 × 10⁹⁶(97-digit number)
17418503925811249423…92677472388087707521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.483 × 10⁹⁶(97-digit number)
34837007851622498847…85354944776175415041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.967 × 10⁹⁶(97-digit number)
69674015703244997695…70709889552350830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.393 × 10⁹⁷(98-digit number)
13934803140648999539…41419779104701660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.786 × 10⁹⁷(98-digit number)
27869606281297999078…82839558209403320321
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,731,576 XPM·at block #6,810,933 · 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.

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