Block #858,255

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 11:41:03 AM · Difficulty 10.9669 · 5,975,093 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c59e5d8fdfda6bb971471f68959b32576c30812a588e8ed97eb6ce3c11f116d

Height

#858,255

Difficulty

10.966874

Transactions

5

Size

1.08 KB

Version

2

Bits

0af78513

Nonce

267,318,004

Timestamp

12/18/2014, 11:41:03 AM

Confirmations

5,975,093

Merkle Root

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

7.406 × 10⁹⁵(96-digit number)
74062904029407700398…85019828807650212799
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
7.406 × 10⁹⁵(96-digit number)
74062904029407700398…85019828807650212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.481 × 10⁹⁶(97-digit number)
14812580805881540079…70039657615300425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.962 × 10⁹⁶(97-digit number)
29625161611763080159…40079315230600851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.925 × 10⁹⁶(97-digit number)
59250323223526160318…80158630461201702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.185 × 10⁹⁷(98-digit number)
11850064644705232063…60317260922403404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.370 × 10⁹⁷(98-digit number)
23700129289410464127…20634521844806809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.740 × 10⁹⁷(98-digit number)
47400258578820928254…41269043689613619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.480 × 10⁹⁷(98-digit number)
94800517157641856509…82538087379227238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.896 × 10⁹⁸(99-digit number)
18960103431528371301…65076174758454476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.792 × 10⁹⁸(99-digit number)
37920206863056742603…30152349516908953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.584 × 10⁹⁸(99-digit number)
75840413726113485207…60304699033817907199
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,910,981 XPM·at block #6,833,347 · 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