Block #518,262

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2014, 11:42:33 AM · Difficulty 10.8533 · 6,292,153 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
44cff2c8816cc1268fd1e6c2288eb99c12709b1c228d9e3913ae64748a556a6b

Height

#518,262

Difficulty

10.853295

Transactions

5

Size

1.08 KB

Version

2

Bits

0ada7186

Nonce

108,539,624

Timestamp

4/30/2014, 11:42:33 AM

Confirmations

6,292,153

Merkle Root

91643e257dbe82550bfb0d2d853f04871bcf987ef5177584e999cea8af0734d0
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.

8.592 × 10¹⁰⁰(101-digit number)
85926976433716354186…50760998245992407041
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
8.592 × 10¹⁰⁰(101-digit number)
85926976433716354186…50760998245992407041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.718 × 10¹⁰¹(102-digit number)
17185395286743270837…01521996491984814081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.437 × 10¹⁰¹(102-digit number)
34370790573486541674…03043992983969628161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.874 × 10¹⁰¹(102-digit number)
68741581146973083348…06087985967939256321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.374 × 10¹⁰²(103-digit number)
13748316229394616669…12175971935878512641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.749 × 10¹⁰²(103-digit number)
27496632458789233339…24351943871757025281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.499 × 10¹⁰²(103-digit number)
54993264917578466679…48703887743514050561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.099 × 10¹⁰³(104-digit number)
10998652983515693335…97407775487028101121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.199 × 10¹⁰³(104-digit number)
21997305967031386671…94815550974056202241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.399 × 10¹⁰³(104-digit number)
43994611934062773343…89631101948112404481
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,727,400 XPM·at block #6,810,414 · 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.

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