Block #1,555,753

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/24/2016, 12:24:13 PM · Difficulty 10.6724 · 5,287,109 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e643bb736de9fe7af047cf44b898392ae5831fc6773b27e05431ff2b6a2aef7a

Height

#1,555,753

Difficulty

10.672403

Transactions

2

Size

426 B

Version

2

Bits

0aac22a0

Nonce

132,583,816

Timestamp

4/24/2016, 12:24:13 PM

Confirmations

5,287,109

Merkle Root

c730e1e4c119625831ce1d9698bc738c68207033b0427859626f323c6f51bc7e
Transactions (2)
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.289 × 10⁹⁵(96-digit number)
22894093549287295346…02083991537538648959
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.289 × 10⁹⁵(96-digit number)
22894093549287295346…02083991537538648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.578 × 10⁹⁵(96-digit number)
45788187098574590692…04167983075077297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.157 × 10⁹⁵(96-digit number)
91576374197149181385…08335966150154595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.831 × 10⁹⁶(97-digit number)
18315274839429836277…16671932300309191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.663 × 10⁹⁶(97-digit number)
36630549678859672554…33343864600618383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.326 × 10⁹⁶(97-digit number)
73261099357719345108…66687729201236766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.465 × 10⁹⁷(98-digit number)
14652219871543869021…33375458402473533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.930 × 10⁹⁷(98-digit number)
29304439743087738043…66750916804947066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.860 × 10⁹⁷(98-digit number)
58608879486175476086…33501833609894133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.172 × 10⁹⁸(99-digit number)
11721775897235095217…67003667219788267519
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,987,244 XPM·at block #6,842,861 · 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