Block #509,798

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/25/2014, 6:47:45 AM · Difficulty 10.8217 · 6,307,152 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ef9cdd93bc8a0058bbeee0f3751696fd1ff41e83df152d54219cf25b95232904

Height

#509,798

Difficulty

10.821653

Transactions

6

Size

1.92 KB

Version

2

Bits

0ad257d4

Nonce

62,939,233

Timestamp

4/25/2014, 6:47:45 AM

Confirmations

6,307,152

Merkle Root

6e996b3dc0ab98cc383ac8630b036229dcd51b98fc37e9f84a3172587a64a1d5
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.256 × 10⁹⁸(99-digit number)
12560234857054468333…02650634316193525361
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.256 × 10⁹⁸(99-digit number)
12560234857054468333…02650634316193525361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.512 × 10⁹⁸(99-digit number)
25120469714108936667…05301268632387050721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.024 × 10⁹⁸(99-digit number)
50240939428217873335…10602537264774101441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.004 × 10⁹⁹(100-digit number)
10048187885643574667…21205074529548202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.009 × 10⁹⁹(100-digit number)
20096375771287149334…42410149059096405761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.019 × 10⁹⁹(100-digit number)
40192751542574298668…84820298118192811521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.038 × 10⁹⁹(100-digit number)
80385503085148597337…69640596236385623041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.607 × 10¹⁰⁰(101-digit number)
16077100617029719467…39281192472771246081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.215 × 10¹⁰⁰(101-digit number)
32154201234059438934…78562384945542492161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.430 × 10¹⁰⁰(101-digit number)
64308402468118877869…57124769891084984321
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,779,644 XPM·at block #6,816,949 · 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