Block #249,861

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/8/2013, 4:50:16 AM · Difficulty 9.9675 · 6,574,852 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8ec2aaa7db27546d00bed007c5cb2f62702d5acb42b9072037176382a1ab0228

Height

#249,861

Difficulty

9.967468

Transactions

4

Size

45.80 KB

Version

2

Bits

09f7abfd

Nonce

6,716

Timestamp

11/8/2013, 4:50:16 AM

Confirmations

6,574,852

Merkle Root

98d8f5efdd9e40d7280d5a04cdf7466e54c21cb24ed6ab470c90d8a34a0684fd
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.

5.073 × 10⁹⁹(100-digit number)
50731819227386753896…48937785717762891519
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
5.073 × 10⁹⁹(100-digit number)
50731819227386753896…48937785717762891519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.014 × 10¹⁰⁰(101-digit number)
10146363845477350779…97875571435525783039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.029 × 10¹⁰⁰(101-digit number)
20292727690954701558…95751142871051566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.058 × 10¹⁰⁰(101-digit number)
40585455381909403117…91502285742103132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.117 × 10¹⁰⁰(101-digit number)
81170910763818806234…83004571484206264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.623 × 10¹⁰¹(102-digit number)
16234182152763761246…66009142968412528639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.246 × 10¹⁰¹(102-digit number)
32468364305527522493…32018285936825057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.493 × 10¹⁰¹(102-digit number)
64936728611055044987…64036571873650114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.298 × 10¹⁰²(103-digit number)
12987345722211008997…28073143747300229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.597 × 10¹⁰²(103-digit number)
25974691444422017995…56146287494600458239
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,841,770 XPM·at block #6,824,712 · 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