Block #510,304

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/25/2014, 2:03:47 PM · Difficulty 10.8241 · 6,305,667 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bbc56b7eb6f1b6b658f52610266e04aaf68fd1c71b94bccf774f9d08d995f9bd

Height

#510,304

Difficulty

10.824122

Transactions

5

Size

1.23 KB

Version

2

Bits

0ad2f9ad

Nonce

109,974

Timestamp

4/25/2014, 2:03:47 PM

Confirmations

6,305,667

Merkle Root

2161704b33f7bff6e1f750e28ffc744cb636fadab05d9c5c55f00c11716123b7
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.193 × 10⁹⁹(100-digit number)
11937621917173121854…54715360713767110401
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.193 × 10⁹⁹(100-digit number)
11937621917173121854…54715360713767110401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.387 × 10⁹⁹(100-digit number)
23875243834346243708…09430721427534220801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.775 × 10⁹⁹(100-digit number)
47750487668692487417…18861442855068441601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.550 × 10⁹⁹(100-digit number)
95500975337384974835…37722885710136883201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.910 × 10¹⁰⁰(101-digit number)
19100195067476994967…75445771420273766401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.820 × 10¹⁰⁰(101-digit number)
38200390134953989934…50891542840547532801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.640 × 10¹⁰⁰(101-digit number)
76400780269907979868…01783085681095065601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.528 × 10¹⁰¹(102-digit number)
15280156053981595973…03566171362190131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.056 × 10¹⁰¹(102-digit number)
30560312107963191947…07132342724380262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.112 × 10¹⁰¹(102-digit number)
61120624215926383894…14264685448760524801
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,771,880 XPM·at block #6,815,970 · 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