Block #856,982

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 12:16:36 PM · Difficulty 10.9677 · 5,987,959 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
908ebd6ce90f96c3f72ede55a36fb3d48f56d8fc8a21ea6afbecfaf1c35d480e

Height

#856,982

Difficulty

10.967677

Transactions

3

Size

692 B

Version

2

Bits

0af7b9a7

Nonce

740,483,349

Timestamp

12/17/2014, 12:16:36 PM

Confirmations

5,987,959

Merkle Root

0d5089835fb49ed049412d01f0a0a11cbe14b08c67c5dc1f3e0ffa930ae7a6f5
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.

1.670 × 10⁹⁵(96-digit number)
16700742926858946144…47712567692326412879
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
1.670 × 10⁹⁵(96-digit number)
16700742926858946144…47712567692326412879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.340 × 10⁹⁵(96-digit number)
33401485853717892289…95425135384652825759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.680 × 10⁹⁵(96-digit number)
66802971707435784578…90850270769305651519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.336 × 10⁹⁶(97-digit number)
13360594341487156915…81700541538611303039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.672 × 10⁹⁶(97-digit number)
26721188682974313831…63401083077222606079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.344 × 10⁹⁶(97-digit number)
53442377365948627662…26802166154445212159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.068 × 10⁹⁷(98-digit number)
10688475473189725532…53604332308890424319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.137 × 10⁹⁷(98-digit number)
21376950946379451065…07208664617780848639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.275 × 10⁹⁷(98-digit number)
42753901892758902130…14417329235561697279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.550 × 10⁹⁷(98-digit number)
85507803785517804260…28834658471123394559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.710 × 10⁹⁸(99-digit number)
17101560757103560852…57669316942246789119
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:58,003,947 XPM·at block #6,844,940 · 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