Block #586,995

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/13/2014, 11:06:30 AM · Difficulty 10.9519 · 6,223,192 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4387880ab89df1846d1995b2a231de32226c031cd44f9908692912333d37d731

Height

#586,995

Difficulty

10.951882

Transactions

7

Size

12.40 KB

Version

2

Bits

0af3ae91

Nonce

760,105,312

Timestamp

6/13/2014, 11:06:30 AM

Confirmations

6,223,192

Merkle Root

971d04b951ab8b9296051561c3834e154d4f9235fe15fce39bb39f9858c4529e
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.422 × 10⁹⁷(98-digit number)
14221801901429458148…62991635765567903749
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.422 × 10⁹⁷(98-digit number)
14221801901429458148…62991635765567903749
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.844 × 10⁹⁷(98-digit number)
28443603802858916296…25983271531135807499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.688 × 10⁹⁷(98-digit number)
56887207605717832592…51966543062271614999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.137 × 10⁹⁸(99-digit number)
11377441521143566518…03933086124543229999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.275 × 10⁹⁸(99-digit number)
22754883042287133036…07866172249086459999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.550 × 10⁹⁸(99-digit number)
45509766084574266073…15732344498172919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.101 × 10⁹⁸(99-digit number)
91019532169148532147…31464688996345839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.820 × 10⁹⁹(100-digit number)
18203906433829706429…62929377992691679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.640 × 10⁹⁹(100-digit number)
36407812867659412859…25858755985383359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.281 × 10⁹⁹(100-digit number)
72815625735318825718…51717511970766719999
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,725,566 XPM·at block #6,810,186 · 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.

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