Block #1,053,372

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2015, 1:00:48 PM · Difficulty 10.7336 · 5,753,071 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d13766491ad56e289f18e92bbeeed7b99526aedbfe459bce366e5ea1143e0c2d

Height

#1,053,372

Difficulty

10.733587

Transactions

5

Size

1.37 KB

Version

2

Bits

0abbcc5c

Nonce

61,635,685

Timestamp

5/10/2015, 1:00:48 PM

Confirmations

5,753,071

Merkle Root

26c12b0bbf7566a56e6db2b477140596a5a268bc95161e51280498607f78e63a
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.

3.304 × 10⁹⁶(97-digit number)
33047316046754939483…45241496515681502719
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
3.304 × 10⁹⁶(97-digit number)
33047316046754939483…45241496515681502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.609 × 10⁹⁶(97-digit number)
66094632093509878966…90482993031363005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.321 × 10⁹⁷(98-digit number)
13218926418701975793…80965986062726010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.643 × 10⁹⁷(98-digit number)
26437852837403951586…61931972125452021759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.287 × 10⁹⁷(98-digit number)
52875705674807903173…23863944250904043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.057 × 10⁹⁸(99-digit number)
10575141134961580634…47727888501808087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.115 × 10⁹⁸(99-digit number)
21150282269923161269…95455777003616174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.230 × 10⁹⁸(99-digit number)
42300564539846322538…90911554007232348159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.460 × 10⁹⁸(99-digit number)
84601129079692645076…81823108014464696319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.692 × 10⁹⁹(100-digit number)
16920225815938529015…63646216028929392639
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,695,633 XPM·at block #6,806,442 · 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