Block #999,212

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/2/2015, 2:37:50 AM · Difficulty 10.7878 · 5,825,983 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
806609ae0b1bd6de786afa7d60832062bda04f7bd3d612bfca2036c5faf0c225

Height

#999,212

Difficulty

10.787758

Transactions

7

Size

8.11 KB

Version

2

Bits

0ac9aa7e

Nonce

17,375,610

Timestamp

4/2/2015, 2:37:50 AM

Confirmations

5,825,983

Merkle Root

9226db1691f6d288007d0d2740b26f218eef599685b9a37b117a2c679d836a47
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.108 × 10⁹⁴(95-digit number)
11084929559329704703…93437516276076528499
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.108 × 10⁹⁴(95-digit number)
11084929559329704703…93437516276076528499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.216 × 10⁹⁴(95-digit number)
22169859118659409406…86875032552153056999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.433 × 10⁹⁴(95-digit number)
44339718237318818812…73750065104306113999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.867 × 10⁹⁴(95-digit number)
88679436474637637624…47500130208612227999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.773 × 10⁹⁵(96-digit number)
17735887294927527524…95000260417224455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.547 × 10⁹⁵(96-digit number)
35471774589855055049…90000520834448911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.094 × 10⁹⁵(96-digit number)
70943549179710110099…80001041668897823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.418 × 10⁹⁶(97-digit number)
14188709835942022019…60002083337795647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.837 × 10⁹⁶(97-digit number)
28377419671884044039…20004166675591295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.675 × 10⁹⁶(97-digit number)
56754839343768088079…40008333351182591999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,845,652 XPM·at block #6,825,194 · 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