Block #1,212,810

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/29/2015, 5:29:48 AM · Difficulty 10.7486 · 5,612,228 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
66dda484ea2ad3bea90627201cb7b7114608e319d8634e9e319c4e7acaebba84

Height

#1,212,810

Difficulty

10.748626

Transactions

3

Size

2.26 KB

Version

2

Bits

0abfa5f2

Nonce

113,750,692

Timestamp

8/29/2015, 5:29:48 AM

Confirmations

5,612,228

Merkle Root

babdf944035d6beb97b04acf8474e1d08638edd4d431c31a0cb49d832e9fcefe
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.

1.545 × 10⁹⁶(97-digit number)
15452608054297734469…70007461741174384641
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
1.545 × 10⁹⁶(97-digit number)
15452608054297734469…70007461741174384641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.090 × 10⁹⁶(97-digit number)
30905216108595468938…40014923482348769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.181 × 10⁹⁶(97-digit number)
61810432217190937877…80029846964697538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.236 × 10⁹⁷(98-digit number)
12362086443438187575…60059693929395077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.472 × 10⁹⁷(98-digit number)
24724172886876375151…20119387858790154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.944 × 10⁹⁷(98-digit number)
49448345773752750302…40238775717580308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.889 × 10⁹⁷(98-digit number)
98896691547505500604…80477551435160616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.977 × 10⁹⁸(99-digit number)
19779338309501100120…60955102870321233921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.955 × 10⁹⁸(99-digit number)
39558676619002200241…21910205740642467841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.911 × 10⁹⁸(99-digit number)
79117353238004400483…43820411481284935681
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,844,388 XPM·at block #6,825,037 · 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