Block #1,536,758

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/11/2016, 6:03:54 PM · Difficulty 10.6289 · 5,290,086 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
69588aa353747b90b1efd82d14d84956df5e90e9223516e2aa470cef189380df

Height

#1,536,758

Difficulty

10.628866

Transactions

2

Size

1.25 KB

Version

2

Bits

0aa0fd60

Nonce

106,619,125

Timestamp

4/11/2016, 6:03:54 PM

Confirmations

5,290,086

Merkle Root

a6963568c0cc1b12af28846a09c64af9e29ffd7d547a6f514c9d03823b4a1599
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.101 × 10⁹⁵(96-digit number)
11015653000338145550…48019272406047091201
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.101 × 10⁹⁵(96-digit number)
11015653000338145550…48019272406047091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.203 × 10⁹⁵(96-digit number)
22031306000676291101…96038544812094182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.406 × 10⁹⁵(96-digit number)
44062612001352582203…92077089624188364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.812 × 10⁹⁵(96-digit number)
88125224002705164406…84154179248376729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.762 × 10⁹⁶(97-digit number)
17625044800541032881…68308358496753459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.525 × 10⁹⁶(97-digit number)
35250089601082065762…36616716993506918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.050 × 10⁹⁶(97-digit number)
70500179202164131525…73233433987013836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.410 × 10⁹⁷(98-digit number)
14100035840432826305…46466867974027673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.820 × 10⁹⁷(98-digit number)
28200071680865652610…92933735948055347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.640 × 10⁹⁷(98-digit number)
56400143361731305220…85867471896110694401
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,858,917 XPM·at block #6,826,843 · 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