Block #1,547,745

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2016, 3:07:20 AM · Difficulty 10.6551 · 5,277,099 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d8344d99cf9c49dced9079821a7b29445023db4d0e6187f3ba45d83147553b09

Height

#1,547,745

Difficulty

10.655132

Transactions

2

Size

1.08 KB

Version

2

Bits

0aa7b6be

Nonce

182,569,367

Timestamp

4/19/2016, 3:07:20 AM

Confirmations

5,277,099

Merkle Root

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

2.261 × 10⁹⁴(95-digit number)
22610642962703628778…36530057648008033439
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
2.261 × 10⁹⁴(95-digit number)
22610642962703628778…36530057648008033439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.522 × 10⁹⁴(95-digit number)
45221285925407257557…73060115296016066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.044 × 10⁹⁴(95-digit number)
90442571850814515114…46120230592032133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.808 × 10⁹⁵(96-digit number)
18088514370162903022…92240461184064267519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.617 × 10⁹⁵(96-digit number)
36177028740325806045…84480922368128535039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.235 × 10⁹⁵(96-digit number)
72354057480651612091…68961844736257070079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.447 × 10⁹⁶(97-digit number)
14470811496130322418…37923689472514140159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.894 × 10⁹⁶(97-digit number)
28941622992260644836…75847378945028280319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.788 × 10⁹⁶(97-digit number)
57883245984521289673…51694757890056560639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.157 × 10⁹⁷(98-digit number)
11576649196904257934…03389515780113121279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,842,833 XPM·at block #6,824,843 · 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