Block #1,534,537

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 7:45:20 AM · Difficulty 10.6168 · 5,273,408 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6eba3a6d1b0c783d57bc9181d7cfdd58b415d3bed2a230e7852768e0355ee887

Height

#1,534,537

Difficulty

10.616774

Transactions

4

Size

22.43 KB

Version

2

Bits

0a9de4e7

Nonce

107,132,184

Timestamp

4/10/2016, 7:45:20 AM

Confirmations

5,273,408

Merkle Root

0bd5e36c2336736ff88fbc0f0008fda97050fb7ef9ab41e34c86d1b3fbffaa04
Transactions (4)
1 in → 1 out9.1000 XPM110 B
51 in → 1 out2827.4668 XPM7.41 KB
51 in → 1 out1165.1982 XPM7.41 KB
51 in → 1 out588.3133 XPM7.42 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.

2.846 × 10⁹⁴(95-digit number)
28467210904681427157…91007928852775737999
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.846 × 10⁹⁴(95-digit number)
28467210904681427157…91007928852775737999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.693 × 10⁹⁴(95-digit number)
56934421809362854314…82015857705551475999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.138 × 10⁹⁵(96-digit number)
11386884361872570862…64031715411102951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.277 × 10⁹⁵(96-digit number)
22773768723745141725…28063430822205903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.554 × 10⁹⁵(96-digit number)
45547537447490283451…56126861644411807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.109 × 10⁹⁵(96-digit number)
91095074894980566903…12253723288823615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.821 × 10⁹⁶(97-digit number)
18219014978996113380…24507446577647231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.643 × 10⁹⁶(97-digit number)
36438029957992226761…49014893155294463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.287 × 10⁹⁶(97-digit number)
72876059915984453522…98029786310588927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.457 × 10⁹⁷(98-digit number)
14575211983196890704…96059572621177855999
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,707,600 XPM·at block #6,807,944 · 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