Block #515,180

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2014, 3:17:07 PM · Difficulty 10.8404 · 6,311,583 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f3e4c18e5ee56830ab87cebb85cd10377dfa3706af8275931d8326eb15ab266f

Height

#515,180

Difficulty

10.840394

Transactions

11

Size

4.50 KB

Version

2

Bits

0ad7240f

Nonce

125,662,295

Timestamp

4/28/2014, 3:17:07 PM

Confirmations

6,311,583

Merkle Root

12efe569add91a57449614db41ee5bbb813e9462cd6cc83762d11ca3b449d31a
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.

9.883 × 10¹⁰⁰(101-digit number)
98831432912430578703…20455114035055964161
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
9.883 × 10¹⁰⁰(101-digit number)
98831432912430578703…20455114035055964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.976 × 10¹⁰¹(102-digit number)
19766286582486115740…40910228070111928321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.953 × 10¹⁰¹(102-digit number)
39532573164972231481…81820456140223856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.906 × 10¹⁰¹(102-digit number)
79065146329944462962…63640912280447713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.581 × 10¹⁰²(103-digit number)
15813029265988892592…27281824560895426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.162 × 10¹⁰²(103-digit number)
31626058531977785185…54563649121790853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.325 × 10¹⁰²(103-digit number)
63252117063955570370…09127298243581706241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.265 × 10¹⁰³(104-digit number)
12650423412791114074…18254596487163412481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.530 × 10¹⁰³(104-digit number)
25300846825582228148…36509192974326824961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.060 × 10¹⁰³(104-digit number)
50601693651164456296…73018385948653649921
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,858,264 XPM·at block #6,826,762 · 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