Block #249,934

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/8/2013, 6:00:52 AM · Difficulty 9.9675 · 6,566,606 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3145d693f85a1073b20a8266c1fba09bb5ea50eb62004dd9b3a799259639e8e1

Height

#249,934

Difficulty

9.967497

Transactions

7

Size

4.50 KB

Version

2

Bits

09f7addf

Nonce

13,413

Timestamp

11/8/2013, 6:00:52 AM

Confirmations

6,566,606

Merkle Root

36aa35a890d17b37ca11b97e26f28615fa95e96a267c76d248ff6cb19a558152
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.088 × 10⁹⁹(100-digit number)
10883279462502118392…26310773708058993919
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.088 × 10⁹⁹(100-digit number)
10883279462502118392…26310773708058993919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.176 × 10⁹⁹(100-digit number)
21766558925004236784…52621547416117987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.353 × 10⁹⁹(100-digit number)
43533117850008473569…05243094832235975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.706 × 10⁹⁹(100-digit number)
87066235700016947139…10486189664471951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.741 × 10¹⁰⁰(101-digit number)
17413247140003389427…20972379328943902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.482 × 10¹⁰⁰(101-digit number)
34826494280006778855…41944758657887805439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.965 × 10¹⁰⁰(101-digit number)
69652988560013557711…83889517315775610879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.393 × 10¹⁰¹(102-digit number)
13930597712002711542…67779034631551221759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.786 × 10¹⁰¹(102-digit number)
27861195424005423084…35558069263102443519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.572 × 10¹⁰¹(102-digit number)
55722390848010846169…71116138526204887039
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,776,448 XPM·at block #6,816,539 · 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