Block #787,489

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/29/2014, 2:25:49 AM · Difficulty 10.9746 · 6,022,202 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5adec939d96a377cfc340dcecf5f93ccd868bb409616861dbc6ac8989475606d

Height

#787,489

Difficulty

10.974616

Transactions

2

Size

1.15 KB

Version

2

Bits

0af98076

Nonce

256,621,393

Timestamp

10/29/2014, 2:25:49 AM

Confirmations

6,022,202

Merkle Root

49f09965e562f1f38a43dd636fb09f2c685540b04927a5830b3ab059addf7e72
Transactions (2)
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.120 × 10⁹⁷(98-digit number)
31204329058676487506…41994684475995668481
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.120 × 10⁹⁷(98-digit number)
31204329058676487506…41994684475995668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.240 × 10⁹⁷(98-digit number)
62408658117352975012…83989368951991336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.248 × 10⁹⁸(99-digit number)
12481731623470595002…67978737903982673921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.496 × 10⁹⁸(99-digit number)
24963463246941190004…35957475807965347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.992 × 10⁹⁸(99-digit number)
49926926493882380009…71914951615930695681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.985 × 10⁹⁸(99-digit number)
99853852987764760019…43829903231861391361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.997 × 10⁹⁹(100-digit number)
19970770597552952003…87659806463722782721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.994 × 10⁹⁹(100-digit number)
39941541195105904007…75319612927445565441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.988 × 10⁹⁹(100-digit number)
79883082390211808015…50639225854891130881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.597 × 10¹⁰⁰(101-digit number)
15976616478042361603…01278451709782261761
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,721,604 XPM·at block #6,809,690 · 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