Block #517,135

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 6:32:12 PM · Difficulty 10.8504 · 6,326,018 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a89bdacbae632f893f132e5f14127b9381039bd6d831f6b33af95d2f39d33054

Height

#517,135

Difficulty

10.850389

Transactions

8

Size

2.38 KB

Version

2

Bits

0ad9b31c

Nonce

132,680,486

Timestamp

4/29/2014, 6:32:12 PM

Confirmations

6,326,018

Merkle Root

becefa46c3b1578b11265eb509c70236a460d661a7a273556bc92c4a350a6704
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.496 × 10⁹⁸(99-digit number)
64961354411612873097…16260759185752403201
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.496 × 10⁹⁸(99-digit number)
64961354411612873097…16260759185752403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.299 × 10⁹⁹(100-digit number)
12992270882322574619…32521518371504806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.598 × 10⁹⁹(100-digit number)
25984541764645149238…65043036743009612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.196 × 10⁹⁹(100-digit number)
51969083529290298477…30086073486019225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.039 × 10¹⁰⁰(101-digit number)
10393816705858059695…60172146972038451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.078 × 10¹⁰⁰(101-digit number)
20787633411716119391…20344293944076902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.157 × 10¹⁰⁰(101-digit number)
41575266823432238782…40688587888153804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.315 × 10¹⁰⁰(101-digit number)
83150533646864477564…81377175776307609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.663 × 10¹⁰¹(102-digit number)
16630106729372895512…62754351552615219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.326 × 10¹⁰¹(102-digit number)
33260213458745791025…25508703105230438401
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,989,590 XPM·at block #6,843,152 · 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