Block #444,186

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/15/2014, 2:39:35 AM · Difficulty 10.3415 · 6,366,645 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e682ba2ffb4116ca696d9a602c0a2965db87822711bb4feb0fa882eeeeb783a

Height

#444,186

Difficulty

10.341520

Transactions

8

Size

3.11 KB

Version

2

Bits

0a576de3

Nonce

621,100

Timestamp

3/15/2014, 2:39:35 AM

Confirmations

6,366,645

Merkle Root

48d828abf806b302aee857d97f5064d9aa1f383d6b231d2024bdad9db3cf19af
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.

2.703 × 10⁹⁸(99-digit number)
27038131618326583595…35725013676628015361
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
2.703 × 10⁹⁸(99-digit number)
27038131618326583595…35725013676628015361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.407 × 10⁹⁸(99-digit number)
54076263236653167191…71450027353256030721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.081 × 10⁹⁹(100-digit number)
10815252647330633438…42900054706512061441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.163 × 10⁹⁹(100-digit number)
21630505294661266876…85800109413024122881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.326 × 10⁹⁹(100-digit number)
43261010589322533752…71600218826048245761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.652 × 10⁹⁹(100-digit number)
86522021178645067505…43200437652096491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.730 × 10¹⁰⁰(101-digit number)
17304404235729013501…86400875304192983041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.460 × 10¹⁰⁰(101-digit number)
34608808471458027002…72801750608385966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.921 × 10¹⁰⁰(101-digit number)
69217616942916054004…45603501216771932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.384 × 10¹⁰¹(102-digit number)
13843523388583210800…91207002433543864321
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,730,743 XPM·at block #6,810,830 · 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