Block #1,053,395

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2015, 1:20:13 PM · Difficulty 10.7337 · 5,791,952 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bb4aeabcd4c6d14f95ec800df14e38a4f36d9c176899104264350f02af15b495

Height

#1,053,395

Difficulty

10.733716

Transactions

2

Size

1.15 KB

Version

2

Bits

0abbd4d5

Nonce

129,178,778

Timestamp

5/10/2015, 1:20:13 PM

Confirmations

5,791,952

Merkle Root

05357d5e79fcb3723ce9c4822acba4b080e45c286c60518df3c404410300d866
Transactions (2)
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.

7.040 × 10⁹⁶(97-digit number)
70407187115301783114…40447552015199615679
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
7.040 × 10⁹⁶(97-digit number)
70407187115301783114…40447552015199615679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.408 × 10⁹⁷(98-digit number)
14081437423060356622…80895104030399231359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.816 × 10⁹⁷(98-digit number)
28162874846120713245…61790208060798462719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.632 × 10⁹⁷(98-digit number)
56325749692241426491…23580416121596925439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.126 × 10⁹⁸(99-digit number)
11265149938448285298…47160832243193850879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.253 × 10⁹⁸(99-digit number)
22530299876896570596…94321664486387701759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.506 × 10⁹⁸(99-digit number)
45060599753793141193…88643328972775403519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.012 × 10⁹⁸(99-digit number)
90121199507586282386…77286657945550807039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.802 × 10⁹⁹(100-digit number)
18024239901517256477…54573315891101614079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.604 × 10⁹⁹(100-digit number)
36048479803034512954…09146631782203228159
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:58,007,218 XPM·at block #6,845,346 · 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