Block #511,035

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/26/2014, 12:05:08 AM · Difficulty 10.8287 · 6,304,017 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d3d5baf484dd0357173095f17d6add77e992971ffd8697d5b41448c922852ec4

Height

#511,035

Difficulty

10.828655

Transactions

11

Size

2.81 KB

Version

2

Bits

0ad422ba

Nonce

66,592,670

Timestamp

4/26/2014, 12:05:08 AM

Confirmations

6,304,017

Merkle Root

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

2.319 × 10⁹⁸(99-digit number)
23193043226467639664…04353923226973702241
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
2.319 × 10⁹⁸(99-digit number)
23193043226467639664…04353923226973702241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.638 × 10⁹⁸(99-digit number)
46386086452935279329…08707846453947404481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.277 × 10⁹⁸(99-digit number)
92772172905870558659…17415692907894808961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.855 × 10⁹⁹(100-digit number)
18554434581174111731…34831385815789617921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.710 × 10⁹⁹(100-digit number)
37108869162348223463…69662771631579235841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.421 × 10⁹⁹(100-digit number)
74217738324696446927…39325543263158471681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.484 × 10¹⁰⁰(101-digit number)
14843547664939289385…78651086526316943361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.968 × 10¹⁰⁰(101-digit number)
29687095329878578771…57302173052633886721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.937 × 10¹⁰⁰(101-digit number)
59374190659757157542…14604346105267773441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.187 × 10¹⁰¹(102-digit number)
11874838131951431508…29208692210535546881
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,764,507 XPM·at block #6,815,051 · 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