Block #1,514,744

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/27/2016, 4:03:54 PM · Difficulty 10.6053 · 5,316,592 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8b013225bdc4c435a57863db795be66ffa96a72a6b3c14467fdd0057e8f911f5

Height

#1,514,744

Difficulty

10.605316

Transactions

3

Size

1.63 KB

Version

2

Bits

0a9af5ff

Nonce

562,849,527

Timestamp

3/27/2016, 4:03:54 PM

Confirmations

5,316,592

Merkle Root

9c7d1163f9f184ff3e36220d4b809f65ef0c986085d23921247fb26b8b53dc28
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.

7.223 × 10⁹⁴(95-digit number)
72236555667949514462…50551952034479687681
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
7.223 × 10⁹⁴(95-digit number)
72236555667949514462…50551952034479687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.444 × 10⁹⁵(96-digit number)
14447311133589902892…01103904068959375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.889 × 10⁹⁵(96-digit number)
28894622267179805785…02207808137918750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.778 × 10⁹⁵(96-digit number)
57789244534359611570…04415616275837501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.155 × 10⁹⁶(97-digit number)
11557848906871922314…08831232551675002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.311 × 10⁹⁶(97-digit number)
23115697813743844628…17662465103350005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.623 × 10⁹⁶(97-digit number)
46231395627487689256…35324930206700011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.246 × 10⁹⁶(97-digit number)
92462791254975378512…70649860413400023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.849 × 10⁹⁷(98-digit number)
18492558250995075702…41299720826800046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.698 × 10⁹⁷(98-digit number)
36985116501990151405…82599441653600092161
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,894,842 XPM·at block #6,831,335 · 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