Block #1,586,394

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2016, 1:11:17 AM · Difficulty 10.6491 · 5,246,701 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d7aade783195ef4eaf2c1668bafe1fedbe075e56d369b1fffad15cb4142cbe8

Height

#1,586,394

Difficulty

10.649133

Transactions

2

Size

867 B

Version

2

Bits

0aa62d8e

Nonce

743,909,408

Timestamp

5/16/2016, 1:11:17 AM

Confirmations

5,246,701

Merkle Root

e445d80ca8e2efee2d1c88f7e6e57c98171da41c693cbdd3646a11d4b040d102
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.

3.284 × 10⁹⁵(96-digit number)
32845747848108407972…54417493961090579199
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
3.284 × 10⁹⁵(96-digit number)
32845747848108407972…54417493961090579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.569 × 10⁹⁵(96-digit number)
65691495696216815944…08834987922181158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.313 × 10⁹⁶(97-digit number)
13138299139243363188…17669975844362316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.627 × 10⁹⁶(97-digit number)
26276598278486726377…35339951688724633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.255 × 10⁹⁶(97-digit number)
52553196556973452755…70679903377449267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.051 × 10⁹⁷(98-digit number)
10510639311394690551…41359806754898534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.102 × 10⁹⁷(98-digit number)
21021278622789381102…82719613509797068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.204 × 10⁹⁷(98-digit number)
42042557245578762204…65439227019594137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.408 × 10⁹⁷(98-digit number)
84085114491157524409…30878454039188275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.681 × 10⁹⁸(99-digit number)
16817022898231504881…61756908078376550399
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,908,935 XPM·at block #6,833,094 · 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