Block #789,564

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/30/2014, 3:04:58 PM · Difficulty 10.9741 · 6,024,319 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a7703d9296bd2e935a5e98ad0a88d95b15c6fd416f8e5b829c6fe04b6bf586e9

Height

#789,564

Difficulty

10.974069

Transactions

6

Size

1.45 KB

Version

2

Bits

0af95c99

Nonce

3,106,387,126

Timestamp

10/30/2014, 3:04:58 PM

Confirmations

6,024,319

Merkle Root

1c75c48f546eb7e402476d757a291bf77b3581a6d3ed5832e331cc7d9844fd3f
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.

9.141 × 10⁹⁷(98-digit number)
91415923008950616205…44733859353809305601
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
9.141 × 10⁹⁷(98-digit number)
91415923008950616205…44733859353809305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.828 × 10⁹⁸(99-digit number)
18283184601790123241…89467718707618611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.656 × 10⁹⁸(99-digit number)
36566369203580246482…78935437415237222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.313 × 10⁹⁸(99-digit number)
73132738407160492964…57870874830474444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.462 × 10⁹⁹(100-digit number)
14626547681432098592…15741749660948889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.925 × 10⁹⁹(100-digit number)
29253095362864197185…31483499321897779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.850 × 10⁹⁹(100-digit number)
58506190725728394371…62966998643795558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.170 × 10¹⁰⁰(101-digit number)
11701238145145678874…25933997287591116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.340 × 10¹⁰⁰(101-digit number)
23402476290291357748…51867994575182233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.680 × 10¹⁰⁰(101-digit number)
46804952580582715497…03735989150364467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.360 × 10¹⁰⁰(101-digit number)
93609905161165430994…07471978300728934401
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,755,140 XPM·at block #6,813,882 · 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