Block #1,054,043

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/11/2015, 12:58:25 AM · Difficulty 10.7311 · 5,752,338 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
12ff4c1de48dc69c36207302a6668a8038bd8b62c28caa527779837cd58095a6

Height

#1,054,043

Difficulty

10.731095

Transactions

11

Size

3.41 KB

Version

2

Bits

0abb2908

Nonce

108,812,850

Timestamp

5/11/2015, 12:58:25 AM

Confirmations

5,752,338

Merkle Root

8648399102aadb914e1995f56dfe77170d7beac907a30babb041b2f5ab3ec116
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.

4.805 × 10⁹⁶(97-digit number)
48059976292286646324…27773818881277501441
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
4.805 × 10⁹⁶(97-digit number)
48059976292286646324…27773818881277501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.611 × 10⁹⁶(97-digit number)
96119952584573292649…55547637762555002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.922 × 10⁹⁷(98-digit number)
19223990516914658529…11095275525110005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.844 × 10⁹⁷(98-digit number)
38447981033829317059…22190551050220011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.689 × 10⁹⁷(98-digit number)
76895962067658634119…44381102100440023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.537 × 10⁹⁸(99-digit number)
15379192413531726823…88762204200880046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.075 × 10⁹⁸(99-digit number)
30758384827063453647…77524408401760092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.151 × 10⁹⁸(99-digit number)
61516769654126907295…55048816803520184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.230 × 10⁹⁹(100-digit number)
12303353930825381459…10097633607040368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.460 × 10⁹⁹(100-digit number)
24606707861650762918…20195267214080737281
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,695,137 XPM·at block #6,806,380 · 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