Block #857,344

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 6:49:22 PM · Difficulty 10.9675 · 5,981,644 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
64d918be76e85c6b4385955fe8984c3cbc85bf5e5c1ca3fa6dd734c3e33fb7e5

Height

#857,344

Difficulty

10.967488

Transactions

14

Size

4.84 KB

Version

2

Bits

0af7ad4f

Nonce

59,805,155

Timestamp

12/17/2014, 6:49:22 PM

Confirmations

5,981,644

Merkle Root

d6e20d8b95812aa9cf32c1c83fe5e506d3f810d23e20ade9044fe4ee1ab4ae1f
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.

3.051 × 10⁹⁵(96-digit number)
30514736509793867872…89553994573389325619
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
3.051 × 10⁹⁵(96-digit number)
30514736509793867872…89553994573389325619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.102 × 10⁹⁵(96-digit number)
61029473019587735744…79107989146778651239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.220 × 10⁹⁶(97-digit number)
12205894603917547148…58215978293557302479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.441 × 10⁹⁶(97-digit number)
24411789207835094297…16431956587114604959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.882 × 10⁹⁶(97-digit number)
48823578415670188595…32863913174229209919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.764 × 10⁹⁶(97-digit number)
97647156831340377190…65727826348458419839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.952 × 10⁹⁷(98-digit number)
19529431366268075438…31455652696916839679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.905 × 10⁹⁷(98-digit number)
39058862732536150876…62911305393833679359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.811 × 10⁹⁷(98-digit number)
78117725465072301752…25822610787667358719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.562 × 10⁹⁸(99-digit number)
15623545093014460350…51645221575334717439
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,956,175 XPM·at block #6,838,987 · 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