Block #612,499

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/2/2014, 4:36:28 PM · Difficulty 10.9272 · 6,212,089 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
680a866505e4dd55dd926984eaff6585fb99c31d79c3a4ce0927824dbb69ad03

Height

#612,499

Difficulty

10.927229

Transactions

6

Size

2.35 KB

Version

2

Bits

0aed5ee6

Nonce

926,981,527

Timestamp

7/2/2014, 4:36:28 PM

Confirmations

6,212,089

Merkle Root

8063d7fbc0bfa65635cbb47d48c6c0c7ddb03763fdb00136a58ae9f218696987
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.892 × 10⁹⁶(97-digit number)
38928257598909295094…32050872223636459201
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.892 × 10⁹⁶(97-digit number)
38928257598909295094…32050872223636459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.785 × 10⁹⁶(97-digit number)
77856515197818590189…64101744447272918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.557 × 10⁹⁷(98-digit number)
15571303039563718037…28203488894545836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.114 × 10⁹⁷(98-digit number)
31142606079127436075…56406977789091673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.228 × 10⁹⁷(98-digit number)
62285212158254872151…12813955578183347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.245 × 10⁹⁸(99-digit number)
12457042431650974430…25627911156366694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.491 × 10⁹⁸(99-digit number)
24914084863301948860…51255822312733388801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.982 × 10⁹⁸(99-digit number)
49828169726603897721…02511644625466777601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.965 × 10⁹⁸(99-digit number)
99656339453207795442…05023289250933555201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.993 × 10⁹⁹(100-digit number)
19931267890641559088…10046578501867110401
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,840,771 XPM·at block #6,824,587 · 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