Block #444,217

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/15/2014, 3:18:46 AM · Difficulty 10.3412 · 6,362,867 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cbbda035d9b0b1e80c2948023db8bc14e86b4a4b965b380585a312529a4f25f1

Height

#444,217

Difficulty

10.341165

Transactions

8

Size

7.69 KB

Version

2

Bits

0a57569c

Nonce

123,956

Timestamp

3/15/2014, 3:18:46 AM

Confirmations

6,362,867

Merkle Root

76cec13c69e77c850d07df497f9cea39d36ab426f327382450ebf55abd7f9878
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.

6.205 × 10⁹⁸(99-digit number)
62050879114077552318…99739287945191869441
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
6.205 × 10⁹⁸(99-digit number)
62050879114077552318…99739287945191869441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.241 × 10⁹⁹(100-digit number)
12410175822815510463…99478575890383738881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.482 × 10⁹⁹(100-digit number)
24820351645631020927…98957151780767477761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.964 × 10⁹⁹(100-digit number)
49640703291262041854…97914303561534955521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.928 × 10⁹⁹(100-digit number)
99281406582524083709…95828607123069911041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.985 × 10¹⁰⁰(101-digit number)
19856281316504816741…91657214246139822081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.971 × 10¹⁰⁰(101-digit number)
39712562633009633483…83314428492279644161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.942 × 10¹⁰⁰(101-digit number)
79425125266019266967…66628856984559288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.588 × 10¹⁰¹(102-digit number)
15885025053203853393…33257713969118576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.177 × 10¹⁰¹(102-digit number)
31770050106407706787…66515427938237153281
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,700,769 XPM·at block #6,807,083 · 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