Block #446,119

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/16/2014, 8:23:53 AM · Difficulty 10.3615 · 6,363,799 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8419e6444ea20f4091bcedcc959e2be0d33b462f2f3a473df3b6efaf32d72446

Height

#446,119

Difficulty

10.361521

Transactions

2

Size

1.25 KB

Version

2

Bits

0a5c8c9d

Nonce

257,048

Timestamp

3/16/2014, 8:23:53 AM

Confirmations

6,363,799

Merkle Root

6eb9c45fd84707accd867360db6098129ed4498db871110513534a4645e99a7d
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.312 × 10⁹⁹(100-digit number)
13123530237310105658…02846321347414579201
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.312 × 10⁹⁹(100-digit number)
13123530237310105658…02846321347414579201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.624 × 10⁹⁹(100-digit number)
26247060474620211316…05692642694829158401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.249 × 10⁹⁹(100-digit number)
52494120949240422632…11385285389658316801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.049 × 10¹⁰⁰(101-digit number)
10498824189848084526…22770570779316633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.099 × 10¹⁰⁰(101-digit number)
20997648379696169053…45541141558633267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.199 × 10¹⁰⁰(101-digit number)
41995296759392338106…91082283117266534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.399 × 10¹⁰⁰(101-digit number)
83990593518784676212…82164566234533068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.679 × 10¹⁰¹(102-digit number)
16798118703756935242…64329132469066137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.359 × 10¹⁰¹(102-digit number)
33596237407513870485…28658264938132275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.719 × 10¹⁰¹(102-digit number)
67192474815027740970…57316529876264550401
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,723,429 XPM·at block #6,809,917 · 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.

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