Block #248,588

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/7/2013, 11:37:40 AM · Difficulty 9.9658 · 6,568,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8efaf18bab300be4f4ed1c6caa995f640ef86b4e9ebfa90255fcb845ebfd1c56

Height

#248,588

Difficulty

9.965845

Transactions

1

Size

1.91 KB

Version

2

Bits

09f741a0

Nonce

8,700

Timestamp

11/7/2013, 11:37:40 AM

Confirmations

6,568,541

Merkle Root

0ce317af31928cdbe9c30987a195b5f744d2f47393781437749a42586fc715a9
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.116 × 10⁹⁶(97-digit number)
11167141590396588001…02777444785369814399
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.116 × 10⁹⁶(97-digit number)
11167141590396588001…02777444785369814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.233 × 10⁹⁶(97-digit number)
22334283180793176003…05554889570739628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.466 × 10⁹⁶(97-digit number)
44668566361586352007…11109779141479257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.933 × 10⁹⁶(97-digit number)
89337132723172704015…22219558282958515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.786 × 10⁹⁷(98-digit number)
17867426544634540803…44439116565917030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.573 × 10⁹⁷(98-digit number)
35734853089269081606…88878233131834060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.146 × 10⁹⁷(98-digit number)
71469706178538163212…77756466263668121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.429 × 10⁹⁸(99-digit number)
14293941235707632642…55512932527336243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.858 × 10⁹⁸(99-digit number)
28587882471415265284…11025865054672486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.717 × 10⁹⁸(99-digit number)
57175764942830530569…22051730109344972799
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,781,066 XPM·at block #6,817,128 · 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