Block #1,597,085

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2016, 8:07:14 PM · Difficulty 10.6112 · 5,230,230 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ae11d6f52ddccbb322fe7d9ed99509e48dce5f7f73e3b182db829e476b17149b

Height

#1,597,085

Difficulty

10.611188

Transactions

2

Size

1.48 KB

Version

2

Bits

0a9c76cd

Nonce

1,181,664,677

Timestamp

5/23/2016, 8:07:14 PM

Confirmations

5,230,230

Merkle Root

820b4cf315dd82890b671d5c7f4dbf3f1bb167d4f36efda2871b94257eddd0cf
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.

2.218 × 10⁹³(94-digit number)
22180029119608650235…36281738101810382221
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
2.218 × 10⁹³(94-digit number)
22180029119608650235…36281738101810382221
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.436 × 10⁹³(94-digit number)
44360058239217300470…72563476203620764441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.872 × 10⁹³(94-digit number)
88720116478434600940…45126952407241528881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.774 × 10⁹⁴(95-digit number)
17744023295686920188…90253904814483057761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.548 × 10⁹⁴(95-digit number)
35488046591373840376…80507809628966115521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.097 × 10⁹⁴(95-digit number)
70976093182747680752…61015619257932231041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.419 × 10⁹⁵(96-digit number)
14195218636549536150…22031238515864462081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.839 × 10⁹⁵(96-digit number)
28390437273099072301…44062477031728924161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.678 × 10⁹⁵(96-digit number)
56780874546198144602…88124954063457848321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.135 × 10⁹⁶(97-digit number)
11356174909239628920…76249908126915696641
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,862,632 XPM·at block #6,827,314 · 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