Block #373,312

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/24/2014, 5:34:15 AM · Difficulty 10.4254 · 6,444,318 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
31e38d67993fa83085b5c901e6eddbef0bc2a0efe2616187a11804e88c2ce4ec

Height

#373,312

Difficulty

10.425442

Transactions

6

Size

1.74 KB

Version

2

Bits

0a6ce9c2

Nonce

264,053

Timestamp

1/24/2014, 5:34:15 AM

Confirmations

6,444,318

Merkle Root

d5e4491358a31017a12b78aedcfe81d808e740130b9a4c39cd853ea162f803fc
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.850 × 10⁹⁹(100-digit number)
28506733600293277153…59480593139833168799
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.850 × 10⁹⁹(100-digit number)
28506733600293277153…59480593139833168799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.701 × 10⁹⁹(100-digit number)
57013467200586554307…18961186279666337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.140 × 10¹⁰⁰(101-digit number)
11402693440117310861…37922372559332675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.280 × 10¹⁰⁰(101-digit number)
22805386880234621723…75844745118665350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.561 × 10¹⁰⁰(101-digit number)
45610773760469243446…51689490237330700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.122 × 10¹⁰⁰(101-digit number)
91221547520938486892…03378980474661401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.824 × 10¹⁰¹(102-digit number)
18244309504187697378…06757960949322803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.648 × 10¹⁰¹(102-digit number)
36488619008375394757…13515921898645606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.297 × 10¹⁰¹(102-digit number)
72977238016750789514…27031843797291212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.459 × 10¹⁰²(103-digit number)
14595447603350157902…54063687594582425599
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,785,092 XPM·at block #6,817,629 · 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