Block #1,581,148

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/12/2016, 5:28:16 AM · Difficulty 10.6661 · 5,236,624 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8c4b6f6ea41cfac37b023d79e02766fa4498185631d8d828c44cd142dffa13c

Height

#1,581,148

Difficulty

10.666055

Transactions

1

Size

243 B

Version

2

Bits

0aaa8296

Nonce

405,751,678

Timestamp

5/12/2016, 5:28:16 AM

Confirmations

5,236,624

Merkle Root

b8de78670dcb3e2f252ebce97add9c3d55bb6f3c388ae9cac6b356a45d4fadff
Transactions (1)
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.

1.579 × 10⁹⁶(97-digit number)
15790115988659483612…24157925079237957119
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
1.579 × 10⁹⁶(97-digit number)
15790115988659483612…24157925079237957119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.158 × 10⁹⁶(97-digit number)
31580231977318967225…48315850158475914239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.316 × 10⁹⁶(97-digit number)
63160463954637934450…96631700316951828479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.263 × 10⁹⁷(98-digit number)
12632092790927586890…93263400633903656959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.526 × 10⁹⁷(98-digit number)
25264185581855173780…86526801267807313919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.052 × 10⁹⁷(98-digit number)
50528371163710347560…73053602535614627839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.010 × 10⁹⁸(99-digit number)
10105674232742069512…46107205071229255679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.021 × 10⁹⁸(99-digit number)
20211348465484139024…92214410142458511359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.042 × 10⁹⁸(99-digit number)
40422696930968278048…84428820284917022719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.084 × 10⁹⁸(99-digit number)
80845393861936556096…68857640569834045439
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,786,233 XPM·at block #6,817,771 · 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