Block #857,044

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 1:24:23 PM · Difficulty 10.9676 · 5,985,282 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3d67f2a652285ac73b44ec0b168578c6eec6a5a6db603a5433503e04f600b0ce

Height

#857,044

Difficulty

10.967645

Transactions

5

Size

1.81 KB

Version

2

Bits

0af7b790

Nonce

15,891,193

Timestamp

12/17/2014, 1:24:23 PM

Confirmations

5,985,282

Merkle Root

0a0bded7a2f26eb9556bea0c5dd3c7222f9a2baec12efbe187eb7bce36dc8dcd
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.

7.330 × 10⁹⁷(98-digit number)
73308587635965613378…84575989177816831999
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
7.330 × 10⁹⁷(98-digit number)
73308587635965613378…84575989177816831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.466 × 10⁹⁸(99-digit number)
14661717527193122675…69151978355633663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.932 × 10⁹⁸(99-digit number)
29323435054386245351…38303956711267327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.864 × 10⁹⁸(99-digit number)
58646870108772490703…76607913422534655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.172 × 10⁹⁹(100-digit number)
11729374021754498140…53215826845069311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.345 × 10⁹⁹(100-digit number)
23458748043508996281…06431653690138623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.691 × 10⁹⁹(100-digit number)
46917496087017992562…12863307380277247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.383 × 10⁹⁹(100-digit number)
93834992174035985124…25726614760554495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.876 × 10¹⁰⁰(101-digit number)
18766998434807197024…51453229521108991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.753 × 10¹⁰⁰(101-digit number)
37533996869614394049…02906459042217983999
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,983,015 XPM·at block #6,842,325 · 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