Block #1,070,401

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2015, 6:10:37 AM · Difficulty 10.7425 · 5,754,937 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
be02814106f0af8cc43db38523a24eebecb8a2a62b650b78783cdec57e93d778

Height

#1,070,401

Difficulty

10.742522

Transactions

5

Size

32.59 KB

Version

2

Bits

0abe15e5

Nonce

224,780,151

Timestamp

5/22/2015, 6:10:37 AM

Confirmations

5,754,937

Merkle Root

bc78d5f337782ee0eb4f4ab1b16e58d668c86d2a02524ea8ac6fb75c502acb6f
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.308 × 10⁹⁴(95-digit number)
13083128774064329219…74272885493369411199
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.308 × 10⁹⁴(95-digit number)
13083128774064329219…74272885493369411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.616 × 10⁹⁴(95-digit number)
26166257548128658439…48545770986738822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.233 × 10⁹⁴(95-digit number)
52332515096257316879…97091541973477644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.046 × 10⁹⁵(96-digit number)
10466503019251463375…94183083946955289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.093 × 10⁹⁵(96-digit number)
20933006038502926751…88366167893910579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.186 × 10⁹⁵(96-digit number)
41866012077005853503…76732335787821158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.373 × 10⁹⁵(96-digit number)
83732024154011707006…53464671575642316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.674 × 10⁹⁶(97-digit number)
16746404830802341401…06929343151284633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.349 × 10⁹⁶(97-digit number)
33492809661604682802…13858686302569267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.698 × 10⁹⁶(97-digit number)
66985619323209365605…27717372605138534399
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,846,808 XPM·at block #6,825,337 · 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