Block #1,548,163

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2016, 10:04:54 AM · Difficulty 10.6552 · 5,261,901 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb980f65aa78cd704c880ec2f0002dd79d128b67e8600996000b255fa606900d

Height

#1,548,163

Difficulty

10.655210

Transactions

37

Size

12.12 KB

Version

2

Bits

0aa7bbd1

Nonce

363,970,322

Timestamp

4/19/2016, 10:04:54 AM

Confirmations

5,261,901

Merkle Root

c45044c36f04d11d3bb314b020896d080e8cc2025f2c416d2925359c9e460d6b
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.527 × 10⁹⁴(95-digit number)
25275983489139738559…95655998782172323199
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.527 × 10⁹⁴(95-digit number)
25275983489139738559…95655998782172323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.055 × 10⁹⁴(95-digit number)
50551966978279477118…91311997564344646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.011 × 10⁹⁵(96-digit number)
10110393395655895423…82623995128689292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.022 × 10⁹⁵(96-digit number)
20220786791311790847…65247990257378585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.044 × 10⁹⁵(96-digit number)
40441573582623581694…30495980514757171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.088 × 10⁹⁵(96-digit number)
80883147165247163389…60991961029514342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.617 × 10⁹⁶(97-digit number)
16176629433049432677…21983922059028684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.235 × 10⁹⁶(97-digit number)
32353258866098865355…43967844118057369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.470 × 10⁹⁶(97-digit number)
64706517732197730711…87935688236114739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.294 × 10⁹⁷(98-digit number)
12941303546439546142…75871376472229478399
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,724,586 XPM·at block #6,810,063 · 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