Block #846,875

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 10:30:06 PM · Difficulty 10.9721 · 5,996,319 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e812e1b79a67fab4ca8fa9ca5c4adb8a749af48786bf6bdda0891b35d398a35f

Height

#846,875

Difficulty

10.972127

Transactions

6

Size

1.44 KB

Version

2

Bits

0af8dd58

Nonce

1,942,897,998

Timestamp

12/9/2014, 10:30:06 PM

Confirmations

5,996,319

Merkle Root

6f77116ca40e8f8c587d5a8d40a2256159b31e36a2496b754874cc5b388c2b4e
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.

8.337 × 10⁹²(93-digit number)
83373738519689848082…73713201801408883119
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
8.337 × 10⁹²(93-digit number)
83373738519689848082…73713201801408883119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.667 × 10⁹³(94-digit number)
16674747703937969616…47426403602817766239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.334 × 10⁹³(94-digit number)
33349495407875939233…94852807205635532479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.669 × 10⁹³(94-digit number)
66698990815751878466…89705614411271064959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.333 × 10⁹⁴(95-digit number)
13339798163150375693…79411228822542129919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.667 × 10⁹⁴(95-digit number)
26679596326300751386…58822457645084259839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.335 × 10⁹⁴(95-digit number)
53359192652601502773…17644915290168519679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.067 × 10⁹⁵(96-digit number)
10671838530520300554…35289830580337039359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.134 × 10⁹⁵(96-digit number)
21343677061040601109…70579661160674078719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.268 × 10⁹⁵(96-digit number)
42687354122081202218…41159322321348157439
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,989,922 XPM·at block #6,843,193 · 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