Block #292,739

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2013, 10:05:59 PM · Difficulty 9.9904 · 6,531,831 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2b8443f54b893442663caf51bb64ec25c45021a6a7bba611a0e455a9a864c6d0

Height

#292,739

Difficulty

9.990392

Transactions

1

Size

1.15 KB

Version

2

Bits

09fd8a50

Nonce

4,093

Timestamp

12/3/2013, 10:05:59 PM

Confirmations

6,531,831

Merkle Root

23de808141761bc8796e32b4b0b4e4b2d3e41575bbb3e8b2fdecccd8977e5932
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.

6.395 × 10⁹⁸(99-digit number)
63958981697957248538…65623104603774342359
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
6.395 × 10⁹⁸(99-digit number)
63958981697957248538…65623104603774342359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.279 × 10⁹⁹(100-digit number)
12791796339591449707…31246209207548684719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.558 × 10⁹⁹(100-digit number)
25583592679182899415…62492418415097369439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.116 × 10⁹⁹(100-digit number)
51167185358365798830…24984836830194738879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.023 × 10¹⁰⁰(101-digit number)
10233437071673159766…49969673660389477759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.046 × 10¹⁰⁰(101-digit number)
20466874143346319532…99939347320778955519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.093 × 10¹⁰⁰(101-digit number)
40933748286692639064…99878694641557911039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.186 × 10¹⁰⁰(101-digit number)
81867496573385278128…99757389283115822079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.637 × 10¹⁰¹(102-digit number)
16373499314677055625…99514778566231644159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.274 × 10¹⁰¹(102-digit number)
32746998629354111251…99029557132463288319
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,840,625 XPM·at block #6,824,569 · 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