Block #1,251,027

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/24/2015, 9:05:24 AM · Difficulty 10.7763 · 5,592,562 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
080fd70f8ba4007c0391015b0bc0041c6bf590cbfca599e20fb287a050c95c3e

Height

#1,251,027

Difficulty

10.776254

Transactions

2

Size

908 B

Version

2

Bits

0ac6b894

Nonce

110,271,039

Timestamp

9/24/2015, 9:05:24 AM

Confirmations

5,592,562

Merkle Root

1b76ae6d6676bf40708c1e80bdef03ba22968479a1df1c61363d178252fba88f
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.509 × 10⁹⁵(96-digit number)
25095172742763904807…70317489268714103739
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.509 × 10⁹⁵(96-digit number)
25095172742763904807…70317489268714103739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.019 × 10⁹⁵(96-digit number)
50190345485527809614…40634978537428207479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.003 × 10⁹⁶(97-digit number)
10038069097105561922…81269957074856414959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.007 × 10⁹⁶(97-digit number)
20076138194211123845…62539914149712829919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.015 × 10⁹⁶(97-digit number)
40152276388422247691…25079828299425659839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.030 × 10⁹⁶(97-digit number)
80304552776844495383…50159656598851319679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.606 × 10⁹⁷(98-digit number)
16060910555368899076…00319313197702639359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.212 × 10⁹⁷(98-digit number)
32121821110737798153…00638626395405278719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.424 × 10⁹⁷(98-digit number)
64243642221475596307…01277252790810557439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.284 × 10⁹⁸(99-digit number)
12848728444295119261…02554505581621114879
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,993,072 XPM·at block #6,843,588 · 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