Block #249,925

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/8/2013, 5:44:54 AM · Difficulty 9.9675 · 6,567,016 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1c5a60f8257f1dd0dc7bbf8e035ef2cd655811ba79cdd3b91a38baabddc034b3

Height

#249,925

Difficulty

9.967536

Transactions

3

Size

2.10 KB

Version

2

Bits

09f7b070

Nonce

2,312

Timestamp

11/8/2013, 5:44:54 AM

Confirmations

6,567,016

Merkle Root

e00ce6a2400bac85b5886e27d0be7ec8334b66b2caee4769ee96d12d8e107fac
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.984 × 10⁹⁹(100-digit number)
59849375127450679820…35370582781566310399
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.984 × 10⁹⁹(100-digit number)
59849375127450679820…35370582781566310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.196 × 10¹⁰⁰(101-digit number)
11969875025490135964…70741165563132620799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.393 × 10¹⁰⁰(101-digit number)
23939750050980271928…41482331126265241599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.787 × 10¹⁰⁰(101-digit number)
47879500101960543856…82964662252530483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.575 × 10¹⁰⁰(101-digit number)
95759000203921087712…65929324505060966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.915 × 10¹⁰¹(102-digit number)
19151800040784217542…31858649010121932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.830 × 10¹⁰¹(102-digit number)
38303600081568435084…63717298020243865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.660 × 10¹⁰¹(102-digit number)
76607200163136870169…27434596040487731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.532 × 10¹⁰²(103-digit number)
15321440032627374033…54869192080975462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.064 × 10¹⁰²(103-digit number)
30642880065254748067…09738384161950924799
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,779,570 XPM·at block #6,816,940 · 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