Block #491,816

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 5:44:41 PM · Difficulty 10.6858 · 6,323,328 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ba9e0811f50bd51eb6b04f0551207b9da3cebb71e1b3f16167df3e96937c618

Height

#491,816

Difficulty

10.685775

Transactions

12

Size

2.91 KB

Version

2

Bits

0aaf8ef1

Nonce

207,140

Timestamp

4/14/2014, 5:44:41 PM

Confirmations

6,323,328

Merkle Root

6ca991eeaf8d104b7d744025e2a714bf1a11b74515de363599c80bfd466a28b4
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.769 × 10¹⁰⁰(101-digit number)
17697321703162980771…86383065976589969921
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.769 × 10¹⁰⁰(101-digit number)
17697321703162980771…86383065976589969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.539 × 10¹⁰⁰(101-digit number)
35394643406325961543…72766131953179939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.078 × 10¹⁰⁰(101-digit number)
70789286812651923087…45532263906359879681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.415 × 10¹⁰¹(102-digit number)
14157857362530384617…91064527812719759361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.831 × 10¹⁰¹(102-digit number)
28315714725060769234…82129055625439518721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.663 × 10¹⁰¹(102-digit number)
56631429450121538469…64258111250879037441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.132 × 10¹⁰²(103-digit number)
11326285890024307693…28516222501758074881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.265 × 10¹⁰²(103-digit number)
22652571780048615387…57032445003516149761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.530 × 10¹⁰²(103-digit number)
45305143560097230775…14064890007032299521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.061 × 10¹⁰²(103-digit number)
90610287120194461551…28129780014064599041
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,765,246 XPM·at block #6,815,143 · 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