Block #848,866

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2014, 9:58:59 AM · Difficulty 10.9714 · 5,993,387 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8bed554137fe6c21bc38cd2b634268d760216cef97a9acb2c9badc79299bc193

Height

#848,866

Difficulty

10.971414

Transactions

5

Size

973 B

Version

2

Bits

0af8ae91

Nonce

1,409,508,907

Timestamp

12/11/2014, 9:58:59 AM

Confirmations

5,993,387

Merkle Root

22c27aa657d3de710fe0a340f1627f142230d3e04772776c3d04ec435ce9ba89
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.

9.713 × 10⁹⁴(95-digit number)
97131063287273802959…21452912279958490619
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
9.713 × 10⁹⁴(95-digit number)
97131063287273802959…21452912279958490619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.942 × 10⁹⁵(96-digit number)
19426212657454760591…42905824559916981239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.885 × 10⁹⁵(96-digit number)
38852425314909521183…85811649119833962479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.770 × 10⁹⁵(96-digit number)
77704850629819042367…71623298239667924959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.554 × 10⁹⁶(97-digit number)
15540970125963808473…43246596479335849919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.108 × 10⁹⁶(97-digit number)
31081940251927616947…86493192958671699839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.216 × 10⁹⁶(97-digit number)
62163880503855233894…72986385917343399679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.243 × 10⁹⁷(98-digit number)
12432776100771046778…45972771834686799359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.486 × 10⁹⁷(98-digit number)
24865552201542093557…91945543669373598719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.973 × 10⁹⁷(98-digit number)
49731104403084187115…83891087338747197439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.946 × 10⁹⁷(98-digit number)
99462208806168374230…67782174677494394879
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,982,421 XPM·at block #6,842,252 · 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