Block #857,346

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 6:49:40 PM · Difficulty 10.9675 · 5,987,674 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee266fb70b04d091b33e66c177503a2ecb6d839277b4250712cbff2a383e99a9

Height

#857,346

Difficulty

10.967500

Transactions

2

Size

467 B

Version

2

Bits

0af7ae11

Nonce

37,955,787

Timestamp

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

Confirmations

5,987,674

Merkle Root

91ea9bd125ef6566974166e28d98ec9f1d939669cfe23f8fb8a46fecbfd5c95e
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.897 × 10⁹⁷(98-digit number)
18971593946808379295…81852324066267832319
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.897 × 10⁹⁷(98-digit number)
18971593946808379295…81852324066267832319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.794 × 10⁹⁷(98-digit number)
37943187893616758591…63704648132535664639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.588 × 10⁹⁷(98-digit number)
75886375787233517183…27409296265071329279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.517 × 10⁹⁸(99-digit number)
15177275157446703436…54818592530142658559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.035 × 10⁹⁸(99-digit number)
30354550314893406873…09637185060285317119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.070 × 10⁹⁸(99-digit number)
60709100629786813746…19274370120570634239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.214 × 10⁹⁹(100-digit number)
12141820125957362749…38548740241141268479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.428 × 10⁹⁹(100-digit number)
24283640251914725498…77097480482282536959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.856 × 10⁹⁹(100-digit number)
48567280503829450997…54194960964565073919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.713 × 10⁹⁹(100-digit number)
97134561007658901994…08389921929130147839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.942 × 10¹⁰⁰(101-digit number)
19426912201531780398…16779843858260295679
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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:58,004,584 XPM·at block #6,845,019 · 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