Block #851,021

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 11:49:25 PM · Difficulty 10.9708 · 5,989,946 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
624efabeba738b4fc4539e240ea4b9cb62c15dac370331d07a11c1251d685d5a

Height

#851,021

Difficulty

10.970821

Transactions

4

Size

879 B

Version

2

Bits

0af887b5

Nonce

1,298,274,393

Timestamp

12/12/2014, 11:49:25 PM

Confirmations

5,989,946

Merkle Root

047a84ea5496af462a86e98ed5fa6079caff84894c4ee5e4c613111454edf2a4
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.

9.977 × 10⁹⁵(96-digit number)
99775237690953606064…38518606007102341119
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
9.977 × 10⁹⁵(96-digit number)
99775237690953606064…38518606007102341119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.995 × 10⁹⁶(97-digit number)
19955047538190721212…77037212014204682239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.991 × 10⁹⁶(97-digit number)
39910095076381442425…54074424028409364479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.982 × 10⁹⁶(97-digit number)
79820190152762884851…08148848056818728959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.596 × 10⁹⁷(98-digit number)
15964038030552576970…16297696113637457919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.192 × 10⁹⁷(98-digit number)
31928076061105153940…32595392227274915839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.385 × 10⁹⁷(98-digit number)
63856152122210307881…65190784454549831679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.277 × 10⁹⁸(99-digit number)
12771230424442061576…30381568909099663359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.554 × 10⁹⁸(99-digit number)
25542460848884123152…60763137818199326719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.108 × 10⁹⁸(99-digit number)
51084921697768246304…21526275636398653439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.021 × 10⁹⁹(100-digit number)
10216984339553649260…43052551272797306879
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,972,093 XPM·at block #6,840,966 · 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