Block #858,483

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 3:59:48 PM · Difficulty 10.9667 · 5,984,066 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dec23a31877f912464e2d5019b4a352257fdc1847a8092c5108391dbfd6d734c

Height

#858,483

Difficulty

10.966664

Transactions

4

Size

988 B

Version

2

Bits

0af77746

Nonce

376,538,425

Timestamp

12/18/2014, 3:59:48 PM

Confirmations

5,984,066

Merkle Root

1ca41b577f7855b2b19166ae9addeb9adc6d0a7d66bce7020c46fea7c3286537
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.023 × 10⁹⁵(96-digit number)
60237076688540112775…05519419611959716639
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.023 × 10⁹⁵(96-digit number)
60237076688540112775…05519419611959716639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.204 × 10⁹⁶(97-digit number)
12047415337708022555…11038839223919433279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.409 × 10⁹⁶(97-digit number)
24094830675416045110…22077678447838866559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.818 × 10⁹⁶(97-digit number)
48189661350832090220…44155356895677733119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.637 × 10⁹⁶(97-digit number)
96379322701664180441…88310713791355466239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.927 × 10⁹⁷(98-digit number)
19275864540332836088…76621427582710932479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.855 × 10⁹⁷(98-digit number)
38551729080665672176…53242855165421864959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.710 × 10⁹⁷(98-digit number)
77103458161331344353…06485710330843729919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.542 × 10⁹⁸(99-digit number)
15420691632266268870…12971420661687459839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.084 × 10⁹⁸(99-digit number)
30841383264532537741…25942841323374919679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.168 × 10⁹⁸(99-digit number)
61682766529065075482…51885682646749839359
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,984,817 XPM·at block #6,842,548 · 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