Block #858,299

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 12:18:06 PM · Difficulty 10.9669 · 5,972,626 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ed887858f112860aa3872f75f55676c6a24239012a413e1c4970206d73030a2d

Height

#858,299

Difficulty

10.966908

Transactions

4

Size

1.12 KB

Version

2

Bits

0af7874f

Nonce

1,480,946,012

Timestamp

12/18/2014, 12:18:06 PM

Confirmations

5,972,626

Merkle Root

8cbe6c94f714df31f1b9d1520bc2d5d2d116544d48bbd6d358c1d95c6710def9
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.

4.950 × 10⁹⁶(97-digit number)
49502372672745340021…17016261246974879039
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
4.950 × 10⁹⁶(97-digit number)
49502372672745340021…17016261246974879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.900 × 10⁹⁶(97-digit number)
99004745345490680042…34032522493949758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.980 × 10⁹⁷(98-digit number)
19800949069098136008…68065044987899516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.960 × 10⁹⁷(98-digit number)
39601898138196272017…36130089975799032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.920 × 10⁹⁷(98-digit number)
79203796276392544034…72260179951598064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.584 × 10⁹⁸(99-digit number)
15840759255278508806…44520359903196129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.168 × 10⁹⁸(99-digit number)
31681518510557017613…89040719806392258559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.336 × 10⁹⁸(99-digit number)
63363037021114035227…78081439612784517119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.267 × 10⁹⁹(100-digit number)
12672607404222807045…56162879225569034239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.534 × 10⁹⁹(100-digit number)
25345214808445614091…12325758451138068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.069 × 10⁹⁹(100-digit number)
50690429616891228182…24651516902276136959
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,891,531 XPM·at block #6,830,924 · 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