Block #1,574,875

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2016, 12:29:43 PM · Difficulty 10.6978 · 5,249,986 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e7f7206cb7343d39c7fe9b55db36560fabb47a9fd05e5ba19053b485216d103e

Height

#1,574,875

Difficulty

10.697840

Transactions

2

Size

5.33 KB

Version

2

Bits

0ab2a5a3

Nonce

667,979,376

Timestamp

5/7/2016, 12:29:43 PM

Confirmations

5,249,986

Merkle Root

86ed845b350051791593ac3030ba55ad2bd521b08f35d9a9da971356d5f83338
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.

3.482 × 10⁹⁷(98-digit number)
34824553024508748770…13602292248934399999
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.482 × 10⁹⁷(98-digit number)
34824553024508748770…13602292248934399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.964 × 10⁹⁷(98-digit number)
69649106049017497540…27204584497868799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.392 × 10⁹⁸(99-digit number)
13929821209803499508…54409168995737599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.785 × 10⁹⁸(99-digit number)
27859642419606999016…08818337991475199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.571 × 10⁹⁸(99-digit number)
55719284839213998032…17636675982950399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.114 × 10⁹⁹(100-digit number)
11143856967842799606…35273351965900799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.228 × 10⁹⁹(100-digit number)
22287713935685599212…70546703931801599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.457 × 10⁹⁹(100-digit number)
44575427871371198425…41093407863603199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.915 × 10⁹⁹(100-digit number)
89150855742742396851…82186815727206399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.783 × 10¹⁰⁰(101-digit number)
17830171148548479370…64373631454412799999
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,842,970 XPM·at block #6,824,860 · 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