Block #787,736

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/29/2014, 6:46:55 AM · Difficulty 10.9746 · 6,039,372 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1cde6877f0ecb8670af8557381a3e739437fa1715b970345efae07848a6be6f3

Height

#787,736

Difficulty

10.974555

Transactions

9

Size

4.25 KB

Version

2

Bits

0af97c73

Nonce

787,715,746

Timestamp

10/29/2014, 6:46:55 AM

Confirmations

6,039,372

Merkle Root

00059c05ce912c006f8bfcaf167726e86f528b753cbf72cd28355ce0b96cfad7
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.

2.389 × 10⁹⁸(99-digit number)
23897698980805633795…28136636687568936961
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
2.389 × 10⁹⁸(99-digit number)
23897698980805633795…28136636687568936961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.779 × 10⁹⁸(99-digit number)
47795397961611267590…56273273375137873921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.559 × 10⁹⁸(99-digit number)
95590795923222535180…12546546750275747841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.911 × 10⁹⁹(100-digit number)
19118159184644507036…25093093500551495681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.823 × 10⁹⁹(100-digit number)
38236318369289014072…50186187001102991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.647 × 10⁹⁹(100-digit number)
76472636738578028144…00372374002205982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.529 × 10¹⁰⁰(101-digit number)
15294527347715605628…00744748004411965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.058 × 10¹⁰⁰(101-digit number)
30589054695431211257…01489496008823930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.117 × 10¹⁰⁰(101-digit number)
61178109390862422515…02978992017647861761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.223 × 10¹⁰¹(102-digit number)
12235621878172484503…05957984035295723521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.447 × 10¹⁰¹(102-digit number)
24471243756344969006…11915968070591447041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,042 XPM·at block #6,827,107 · 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