Block #1,534,594

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 8:37:09 AM · Difficulty 10.6172 · 5,283,427 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c9e75f01fbd9ab4f6bce6c9eeba6e6fbe9070bb6666a56653a54ccfba59fa9d

Height

#1,534,594

Difficulty

10.617222

Transactions

5

Size

48.41 KB

Version

2

Bits

0a9e0248

Nonce

211,883,157

Timestamp

4/10/2016, 8:37:09 AM

Confirmations

5,283,427

Merkle Root

fc039e76c54c3bab626b0257dc1e5c74130d02e98dcfd3a50c3bedf91850e63a
Transactions (5)
1 in → 1 out9.3700 XPM110 B
51 in → 1 out2918.6672 XPM7.41 KB
51 in → 1 out1237.5348 XPM7.41 KB
51 in → 1 out624.3072 XPM7.43 KB
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.855 × 10⁹⁶(97-digit number)
18553920354561396605…34741918955993692159
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.855 × 10⁹⁶(97-digit number)
18553920354561396605…34741918955993692159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.710 × 10⁹⁶(97-digit number)
37107840709122793210…69483837911987384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.421 × 10⁹⁶(97-digit number)
74215681418245586421…38967675823974768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.484 × 10⁹⁷(98-digit number)
14843136283649117284…77935351647949537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.968 × 10⁹⁷(98-digit number)
29686272567298234568…55870703295899074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.937 × 10⁹⁷(98-digit number)
59372545134596469137…11741406591798149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.187 × 10⁹⁸(99-digit number)
11874509026919293827…23482813183596298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.374 × 10⁹⁸(99-digit number)
23749018053838587654…46965626367192596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.749 × 10⁹⁸(99-digit number)
47498036107677175309…93931252734385192959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.499 × 10⁹⁸(99-digit number)
94996072215354350619…87862505468770385919
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,788,235 XPM·at block #6,818,020 · 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