Block #865,859

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/24/2014, 5:12:04 AM · Difficulty 10.9626 · 5,943,301 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
063404b9b2b3feb3412c4db5e2d3fc47bc9ba5a41a504ded3d56c7e263fe0c66

Height

#865,859

Difficulty

10.962568

Transactions

4

Size

882 B

Version

2

Bits

0af66ad8

Nonce

2,193,764,144

Timestamp

12/24/2014, 5:12:04 AM

Confirmations

5,943,301

Merkle Root

aa3e5c5987738ceacf7d3513471acf816e886a982bc06e9b399a0522abce0d3d
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.

6.018 × 10⁹⁴(95-digit number)
60184845172437844274…24498288137821417939
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
6.018 × 10⁹⁴(95-digit number)
60184845172437844274…24498288137821417939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.203 × 10⁹⁵(96-digit number)
12036969034487568854…48996576275642835879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.407 × 10⁹⁵(96-digit number)
24073938068975137709…97993152551285671759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.814 × 10⁹⁵(96-digit number)
48147876137950275419…95986305102571343519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.629 × 10⁹⁵(96-digit number)
96295752275900550838…91972610205142687039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.925 × 10⁹⁶(97-digit number)
19259150455180110167…83945220410285374079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.851 × 10⁹⁶(97-digit number)
38518300910360220335…67890440820570748159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.703 × 10⁹⁶(97-digit number)
77036601820720440670…35780881641141496319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.540 × 10⁹⁷(98-digit number)
15407320364144088134…71561763282282992639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.081 × 10⁹⁷(98-digit number)
30814640728288176268…43123526564565985279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.162 × 10⁹⁷(98-digit number)
61629281456576352536…86247053129131970559
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,717,341 XPM·at block #6,809,159 · 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.

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