Block #251,059

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/8/2013, 7:50:30 PM · Difficulty 9.9694 · 6,565,699 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
48bda6ac73f3048430ef559aa5762770acef17b495f4d7faa739e8fd5af2b10c

Height

#251,059

Difficulty

9.969377

Transactions

6

Size

1.95 KB

Version

2

Bits

09f82911

Nonce

26,660

Timestamp

11/8/2013, 7:50:30 PM

Confirmations

6,565,699

Merkle Root

477a98f5c5f12dad2dd8ef397b2772d86aaa2bd85876960a41e329a68bd7078e
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.

9.213 × 10⁹¹(92-digit number)
92131553567588817602…74809417526890598401
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
9.213 × 10⁹¹(92-digit number)
92131553567588817602…74809417526890598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.842 × 10⁹²(93-digit number)
18426310713517763520…49618835053781196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.685 × 10⁹²(93-digit number)
36852621427035527041…99237670107562393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.370 × 10⁹²(93-digit number)
73705242854071054082…98475340215124787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.474 × 10⁹³(94-digit number)
14741048570814210816…96950680430249574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.948 × 10⁹³(94-digit number)
29482097141628421632…93901360860499148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.896 × 10⁹³(94-digit number)
58964194283256843265…87802721720998297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.179 × 10⁹⁴(95-digit number)
11792838856651368653…75605443441996595201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.358 × 10⁹⁴(95-digit number)
23585677713302737306…51210886883993190401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.717 × 10⁹⁴(95-digit number)
47171355426605474612…02421773767986380801
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,778,095 XPM·at block #6,816,757 · 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