Block #1,257,759

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/28/2015, 1:04:55 PM · Difficulty 10.8069 · 5,560,036 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5cf6c653be2eef08d12af6b95b27b9ee5cae364f8e4e746996b3e9aead577f61

Height

#1,257,759

Difficulty

10.806855

Transactions

2

Size

1.04 KB

Version

2

Bits

0ace8e0d

Nonce

220,450,838

Timestamp

9/28/2015, 1:04:55 PM

Confirmations

5,560,036

Merkle Root

05fbcdd463881865b800a8072bbc225d1268046879d321f9a78a02c7d4c4b9cc
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.

5.631 × 10⁹⁴(95-digit number)
56319752456803733624…74575398762948934561
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
5.631 × 10⁹⁴(95-digit number)
56319752456803733624…74575398762948934561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.126 × 10⁹⁵(96-digit number)
11263950491360746724…49150797525897869121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.252 × 10⁹⁵(96-digit number)
22527900982721493449…98301595051795738241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.505 × 10⁹⁵(96-digit number)
45055801965442986899…96603190103591476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.011 × 10⁹⁵(96-digit number)
90111603930885973798…93206380207182952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.802 × 10⁹⁶(97-digit number)
18022320786177194759…86412760414365905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.604 × 10⁹⁶(97-digit number)
36044641572354389519…72825520828731811841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.208 × 10⁹⁶(97-digit number)
72089283144708779039…45651041657463623681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.441 × 10⁹⁷(98-digit number)
14417856628941755807…91302083314927247361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.883 × 10⁹⁷(98-digit number)
28835713257883511615…82604166629854494721
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,786,420 XPM·at block #6,817,794 · 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