Block #1,513,580

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/26/2016, 9:02:46 PM · Difficulty 10.6035 · 5,303,735 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84884b638a3a43d542acfcd899acc86acc0e0da161633f0d4beaeaf7282e86a1

Height

#1,513,580

Difficulty

10.603550

Transactions

2

Size

1.01 KB

Version

2

Bits

0a9a823c

Nonce

29,847,125

Timestamp

3/26/2016, 9:02:46 PM

Confirmations

5,303,735

Merkle Root

f7f9ec1ece0d91f30b968136399553083607db17d1cb98b00666f942055da7cd
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.

6.283 × 10⁹⁴(95-digit number)
62835382626025421126…34395761390592644481
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
6.283 × 10⁹⁴(95-digit number)
62835382626025421126…34395761390592644481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.256 × 10⁹⁵(96-digit number)
12567076525205084225…68791522781185288961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.513 × 10⁹⁵(96-digit number)
25134153050410168450…37583045562370577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.026 × 10⁹⁵(96-digit number)
50268306100820336901…75166091124741155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.005 × 10⁹⁶(97-digit number)
10053661220164067380…50332182249482311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.010 × 10⁹⁶(97-digit number)
20107322440328134760…00664364498964623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.021 × 10⁹⁶(97-digit number)
40214644880656269520…01328728997929246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.042 × 10⁹⁶(97-digit number)
80429289761312539041…02657457995858493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.608 × 10⁹⁷(98-digit number)
16085857952262507808…05314915991716986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.217 × 10⁹⁷(98-digit number)
32171715904525015616…10629831983433973761
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,782,565 XPM·at block #6,817,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