Block #1,514,741

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/27/2016, 3:58:44 PM · Difficulty 10.6055 · 5,312,322 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
919d700a1454719fd58b07af49cfafeead98eb63e037d411e226aeb1e66149ff

Height

#1,514,741

Difficulty

10.605538

Transactions

5

Size

7.25 KB

Version

2

Bits

0a9b0486

Nonce

1,368,234,078

Timestamp

3/27/2016, 3:58:44 PM

Confirmations

5,312,322

Merkle Root

f9f0ad64ad8469e142dfc1bef423a7375d80f3939c84b6bd5353ef32004ba679
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.016 × 10⁹⁴(95-digit number)
10167678246159998982…21860647834472817211
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.016 × 10⁹⁴(95-digit number)
10167678246159998982…21860647834472817211
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.033 × 10⁹⁴(95-digit number)
20335356492319997965…43721295668945634421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.067 × 10⁹⁴(95-digit number)
40670712984639995931…87442591337891268841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.134 × 10⁹⁴(95-digit number)
81341425969279991862…74885182675782537681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.626 × 10⁹⁵(96-digit number)
16268285193855998372…49770365351565075361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.253 × 10⁹⁵(96-digit number)
32536570387711996744…99540730703130150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.507 × 10⁹⁵(96-digit number)
65073140775423993489…99081461406260301441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.301 × 10⁹⁶(97-digit number)
13014628155084798697…98162922812520602881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.602 × 10⁹⁶(97-digit number)
26029256310169597395…96325845625041205761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.205 × 10⁹⁶(97-digit number)
52058512620339194791…92651691250082411521
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,860,688 XPM·at block #6,827,062 · 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