Block #1,596,083

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/23/2016, 3:05:40 AM · Difficulty 10.6125 · 5,218,217 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c3ea74f748440b829b75e87bf1584cbec55058683d80460f70510e37631e9121

Height

#1,596,083

Difficulty

10.612461

Transactions

2

Size

834 B

Version

2

Bits

0a9cca37

Nonce

1,325,271,121

Timestamp

5/23/2016, 3:05:40 AM

Confirmations

5,218,217

Merkle Root

46de8872d9e0df5f211be1c549653cb9ee8ea761b26d4d38f2bd32542ac4cef4
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.056 × 10⁹⁵(96-digit number)
10560581566104270374…76898207166417825119
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.056 × 10⁹⁵(96-digit number)
10560581566104270374…76898207166417825119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.112 × 10⁹⁵(96-digit number)
21121163132208540749…53796414332835650239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.224 × 10⁹⁵(96-digit number)
42242326264417081499…07592828665671300479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.448 × 10⁹⁵(96-digit number)
84484652528834162998…15185657331342600959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.689 × 10⁹⁶(97-digit number)
16896930505766832599…30371314662685201919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.379 × 10⁹⁶(97-digit number)
33793861011533665199…60742629325370403839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.758 × 10⁹⁶(97-digit number)
67587722023067330398…21485258650740807679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.351 × 10⁹⁷(98-digit number)
13517544404613466079…42970517301481615359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.703 × 10⁹⁷(98-digit number)
27035088809226932159…85941034602963230719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.407 × 10⁹⁷(98-digit number)
54070177618453864318…71882069205926461439
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,758,464 XPM·at block #6,814,299 · 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