Block #446,021

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/16/2014, 6:59:15 AM · Difficulty 10.3597 · 6,379,294 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0b50218e0cf89edd64479743f988dcf958f23060183ad10b319da6fb670feceb

Height

#446,021

Difficulty

10.359681

Transactions

2

Size

3.38 KB

Version

2

Bits

0a5c140a

Nonce

82,218

Timestamp

3/16/2014, 6:59:15 AM

Confirmations

6,379,294

Merkle Root

8e036386c64788f174317519af93b29525dfe135cf0a8d791345286ffb9a5628
Transactions (2)
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.021 × 10⁹⁹(100-digit number)
10213028572174278904…43205232964625459201
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.021 × 10⁹⁹(100-digit number)
10213028572174278904…43205232964625459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.042 × 10⁹⁹(100-digit number)
20426057144348557808…86410465929250918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.085 × 10⁹⁹(100-digit number)
40852114288697115616…72820931858501836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.170 × 10⁹⁹(100-digit number)
81704228577394231232…45641863717003673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.634 × 10¹⁰⁰(101-digit number)
16340845715478846246…91283727434007347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.268 × 10¹⁰⁰(101-digit number)
32681691430957692493…82567454868014694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.536 × 10¹⁰⁰(101-digit number)
65363382861915384986…65134909736029388801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.307 × 10¹⁰¹(102-digit number)
13072676572383076997…30269819472058777601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.614 × 10¹⁰¹(102-digit number)
26145353144766153994…60539638944117555201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.229 × 10¹⁰¹(102-digit number)
52290706289532307989…21079277888235110401
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,846,624 XPM·at block #6,825,314 · 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