Block #249,760

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/8/2013, 3:37:13 AM · Difficulty 9.9673 · 6,566,915 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
732815ab8744d22475cbb77171532f8b89b9fc8ac5cad217cd099c3482f70460

Height

#249,760

Difficulty

9.967282

Transactions

4

Size

913 B

Version

2

Bits

09f79fd0

Nonce

1,583

Timestamp

11/8/2013, 3:37:13 AM

Confirmations

6,566,915

Merkle Root

e3fb4f3587a7b76028f025be35d9bfd6b37774e296e7feb8bd6f1d368b59e785
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.551 × 10⁹⁸(99-digit number)
25511983683196677996…48558619284127045119
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.551 × 10⁹⁸(99-digit number)
25511983683196677996…48558619284127045119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.102 × 10⁹⁸(99-digit number)
51023967366393355992…97117238568254090239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.020 × 10⁹⁹(100-digit number)
10204793473278671198…94234477136508180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.040 × 10⁹⁹(100-digit number)
20409586946557342397…88468954273016360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.081 × 10⁹⁹(100-digit number)
40819173893114684794…76937908546032721919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.163 × 10⁹⁹(100-digit number)
81638347786229369588…53875817092065443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.632 × 10¹⁰⁰(101-digit number)
16327669557245873917…07751634184130887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.265 × 10¹⁰⁰(101-digit number)
32655339114491747835…15503268368261775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.531 × 10¹⁰⁰(101-digit number)
65310678228983495670…31006536736523550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.306 × 10¹⁰¹(102-digit number)
13062135645796699134…62013073473047101439
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,777,519 XPM·at block #6,816,674 · 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