Block #515,615

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2014, 9:42:41 PM · Difficulty 10.8420 · 6,311,518 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e242ce86c2618ab4fef1be063c0ba70aca014d6cd7b7029358b2f667ef3e2b3d

Height

#515,615

Difficulty

10.842046

Transactions

9

Size

2.54 KB

Version

2

Bits

0ad7905c

Nonce

79,452

Timestamp

4/28/2014, 9:42:41 PM

Confirmations

6,311,518

Merkle Root

31f51301fb7cd1f37fb1a7ffca2d31b72b518378fdec96bd76883b91e312ec8f
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.

4.408 × 10⁹⁹(100-digit number)
44085874753312142807…90680737641593502251
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
4.408 × 10⁹⁹(100-digit number)
44085874753312142807…90680737641593502251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.817 × 10⁹⁹(100-digit number)
88171749506624285615…81361475283187004501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.763 × 10¹⁰⁰(101-digit number)
17634349901324857123…62722950566374009001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.526 × 10¹⁰⁰(101-digit number)
35268699802649714246…25445901132748018001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.053 × 10¹⁰⁰(101-digit number)
70537399605299428492…50891802265496036001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.410 × 10¹⁰¹(102-digit number)
14107479921059885698…01783604530992072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.821 × 10¹⁰¹(102-digit number)
28214959842119771396…03567209061984144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.642 × 10¹⁰¹(102-digit number)
56429919684239542793…07134418123968288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.128 × 10¹⁰²(103-digit number)
11285983936847908558…14268836247936576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.257 × 10¹⁰²(103-digit number)
22571967873695817117…28537672495873152001
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,861,244 XPM·at block #6,827,132 · 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