Block #443,130

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/14/2014, 8:31:36 AM · Difficulty 10.3439 · 6,366,688 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8d160a85b7662dbc40faf6ccca49fc8a0151d46f6b0b843b296378222772258c

Height

#443,130

Difficulty

10.343857

Transactions

5

Size

2.10 KB

Version

2

Bits

0a5806fc

Nonce

75,456

Timestamp

3/14/2014, 8:31:36 AM

Confirmations

6,366,688

Merkle Root

65a383021f164ff6ab57d4484c6416dd24bd4a3c9180e25b2b7aff184a2bc511
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.

4.503 × 10⁹⁸(99-digit number)
45039209129131139770…78188087348855562241
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
4.503 × 10⁹⁸(99-digit number)
45039209129131139770…78188087348855562241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.007 × 10⁹⁸(99-digit number)
90078418258262279541…56376174697711124481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.801 × 10⁹⁹(100-digit number)
18015683651652455908…12752349395422248961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.603 × 10⁹⁹(100-digit number)
36031367303304911816…25504698790844497921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.206 × 10⁹⁹(100-digit number)
72062734606609823633…51009397581688995841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.441 × 10¹⁰⁰(101-digit number)
14412546921321964726…02018795163377991681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.882 × 10¹⁰⁰(101-digit number)
28825093842643929453…04037590326755983361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.765 × 10¹⁰⁰(101-digit number)
57650187685287858906…08075180653511966721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.153 × 10¹⁰¹(102-digit number)
11530037537057571781…16150361307023933441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.306 × 10¹⁰¹(102-digit number)
23060075074115143562…32300722614047866881
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,722,628 XPM·at block #6,809,817 · 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