Block #846,223

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 11:18:05 AM · Difficulty 10.9722 · 5,996,701 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7b8c9e7d0a682a435cfe311a3fabe7e3f1a34c00b8b82ed6fff2f9806ef36181

Height

#846,223

Difficulty

10.972219

Transactions

9

Size

2.00 KB

Version

2

Bits

0af8e359

Nonce

1,974,916,366

Timestamp

12/9/2014, 11:18:05 AM

Confirmations

5,996,701

Merkle Root

7626c0f219a665efef36ccdab3e1bfef7bfeeeb0483bfd6d9cc9b8ef81309b29
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.

2.069 × 10⁹⁸(99-digit number)
20695833043755057808…63962300217980518399
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
2.069 × 10⁹⁸(99-digit number)
20695833043755057808…63962300217980518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.139 × 10⁹⁸(99-digit number)
41391666087510115617…27924600435961036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.278 × 10⁹⁸(99-digit number)
82783332175020231234…55849200871922073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.655 × 10⁹⁹(100-digit number)
16556666435004046246…11698401743844147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.311 × 10⁹⁹(100-digit number)
33113332870008092493…23396803487688294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.622 × 10⁹⁹(100-digit number)
66226665740016184987…46793606975376588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.324 × 10¹⁰⁰(101-digit number)
13245333148003236997…93587213950753177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.649 × 10¹⁰⁰(101-digit number)
26490666296006473995…87174427901506355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.298 × 10¹⁰⁰(101-digit number)
52981332592012947990…74348855803012710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.059 × 10¹⁰¹(102-digit number)
10596266518402589598…48697711606025420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.119 × 10¹⁰¹(102-digit number)
21192533036805179196…97395423212050841599
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,987,740 XPM·at block #6,842,923 · 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