Block #515,334

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2014, 5:37:18 PM · Difficulty 10.8408 · 6,311,471 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b2aa2cc3684aff57667158c57a260cdfb7fdb0a3c203b436a7d5cdcdb38b7679

Height

#515,334

Difficulty

10.840836

Transactions

6

Size

1.89 KB

Version

2

Bits

0ad7410c

Nonce

30,613,967

Timestamp

4/28/2014, 5:37:18 PM

Confirmations

6,311,471

Merkle Root

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

1.360 × 10¹⁰⁰(101-digit number)
13600362686604905834…41983927024862067201
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
1.360 × 10¹⁰⁰(101-digit number)
13600362686604905834…41983927024862067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.720 × 10¹⁰⁰(101-digit number)
27200725373209811668…83967854049724134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.440 × 10¹⁰⁰(101-digit number)
54401450746419623337…67935708099448268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.088 × 10¹⁰¹(102-digit number)
10880290149283924667…35871416198896537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.176 × 10¹⁰¹(102-digit number)
21760580298567849335…71742832397793075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.352 × 10¹⁰¹(102-digit number)
43521160597135698670…43485664795586150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.704 × 10¹⁰¹(102-digit number)
87042321194271397340…86971329591172300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.740 × 10¹⁰²(103-digit number)
17408464238854279468…73942659182344601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.481 × 10¹⁰²(103-digit number)
34816928477708558936…47885318364689203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.963 × 10¹⁰²(103-digit number)
69633856955417117872…95770636729378406401
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,604 XPM·at block #6,826,804 · 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