Block #847,008

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2014, 1:09:20 AM · Difficulty 10.9720 · 5,996,059 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4be82e9cd207f8806cb4d82b95a1a3379f8545e5ec44df98e1d9aa5d3e090d75

Height

#847,008

Difficulty

10.971990

Transactions

13

Size

2.85 KB

Version

2

Bits

0af8d451

Nonce

235,570,837

Timestamp

12/10/2014, 1:09:20 AM

Confirmations

5,996,059

Merkle Root

4279d78e231ad0cd87787f1f9eef1c5d3a808fe5cf6aff0dc39d53656d777f12
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.750 × 10⁹⁶(97-digit number)
37504576740840988433…62528912845078647679
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.750 × 10⁹⁶(97-digit number)
37504576740840988433…62528912845078647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.500 × 10⁹⁶(97-digit number)
75009153481681976867…25057825690157295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.500 × 10⁹⁷(98-digit number)
15001830696336395373…50115651380314590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.000 × 10⁹⁷(98-digit number)
30003661392672790747…00231302760629181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.000 × 10⁹⁷(98-digit number)
60007322785345581494…00462605521258362879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.200 × 10⁹⁸(99-digit number)
12001464557069116298…00925211042516725759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.400 × 10⁹⁸(99-digit number)
24002929114138232597…01850422085033451519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.800 × 10⁹⁸(99-digit number)
48005858228276465195…03700844170066903039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.601 × 10⁹⁸(99-digit number)
96011716456552930390…07401688340133806079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.920 × 10⁹⁹(100-digit number)
19202343291310586078…14803376680267612159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.840 × 10⁹⁹(100-digit number)
38404686582621172156…29606753360535224319
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:57,988,894 XPM·at block #6,843,066 · 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