Block #431,177

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2014, 12:45:52 AM · Difficulty 10.3415 · 6,394,944 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
66edff8ea0663a11f5175752e5c1d787f074db4e20f20c0898c94726ab4bab1c

Height

#431,177

Difficulty

10.341459

Transactions

4

Size

1.93 KB

Version

2

Bits

0a5769da

Nonce

6,629

Timestamp

3/6/2014, 12:45:52 AM

Confirmations

6,394,944

Merkle Root

3950a31b17bcb231442eeba0b5a535909cfa4b898eda0fce54848763cba98f21
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.

3.147 × 10⁹⁸(99-digit number)
31475337313539678394…69346955758540951521
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
3.147 × 10⁹⁸(99-digit number)
31475337313539678394…69346955758540951521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.295 × 10⁹⁸(99-digit number)
62950674627079356789…38693911517081903041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.259 × 10⁹⁹(100-digit number)
12590134925415871357…77387823034163806081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.518 × 10⁹⁹(100-digit number)
25180269850831742715…54775646068327612161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.036 × 10⁹⁹(100-digit number)
50360539701663485431…09551292136655224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.007 × 10¹⁰⁰(101-digit number)
10072107940332697086…19102584273310448641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.014 × 10¹⁰⁰(101-digit number)
20144215880665394172…38205168546620897281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.028 × 10¹⁰⁰(101-digit number)
40288431761330788345…76410337093241794561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.057 × 10¹⁰⁰(101-digit number)
80576863522661576690…52820674186483589121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.611 × 10¹⁰¹(102-digit number)
16115372704532315338…05641348372967178241
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,853,093 XPM·at block #6,826,120 · 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