Block #1,597,697

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2016, 6:39:49 AM · Difficulty 10.6094 · 5,229,600 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c59906b46c34175e78094886cdc2a066ff6eff9f3e152292851ffbe585a78e5

Height

#1,597,697

Difficulty

10.609421

Transactions

2

Size

3.16 KB

Version

2

Bits

0a9c030a

Nonce

1,162,852,442

Timestamp

5/24/2016, 6:39:49 AM

Confirmations

5,229,600

Merkle Root

ab375bde95aea8bf538dc90c4a85bc879c85ddb95a1c1ac72aba78f08eb52c33
Transactions (2)
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.217 × 10⁹⁵(96-digit number)
12170772844445715345…33173768833575180799
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.217 × 10⁹⁵(96-digit number)
12170772844445715345…33173768833575180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.434 × 10⁹⁵(96-digit number)
24341545688891430691…66347537667150361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.868 × 10⁹⁵(96-digit number)
48683091377782861383…32695075334300723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.736 × 10⁹⁵(96-digit number)
97366182755565722766…65390150668601446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.947 × 10⁹⁶(97-digit number)
19473236551113144553…30780301337202892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.894 × 10⁹⁶(97-digit number)
38946473102226289106…61560602674405785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.789 × 10⁹⁶(97-digit number)
77892946204452578213…23121205348811571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.557 × 10⁹⁷(98-digit number)
15578589240890515642…46242410697623142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.115 × 10⁹⁷(98-digit number)
31157178481781031285…92484821395246284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.231 × 10⁹⁷(98-digit number)
62314356963562062570…84969642790492569599
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,862,486 XPM·at block #6,827,296 · 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