Block #440,179

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 6:23:00 AM · Difficulty 10.3502 · 6,366,440 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4c12db479c131a3b875cae4fd258ff0322622b64f827dd880ffd22f4d21793e5

Height

#440,179

Difficulty

10.350233

Transactions

4

Size

1.54 KB

Version

2

Bits

0a59a8d8

Nonce

46,334

Timestamp

3/12/2014, 6:23:00 AM

Confirmations

6,366,440

Merkle Root

67922d5503202ceeb9abef5f75483dfc4e48884d09e16f5e4a42df64413cb614
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.987 × 10⁹⁷(98-digit number)
19879494519299038983…90605077641755370841
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.987 × 10⁹⁷(98-digit number)
19879494519299038983…90605077641755370841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.975 × 10⁹⁷(98-digit number)
39758989038598077967…81210155283510741681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.951 × 10⁹⁷(98-digit number)
79517978077196155935…62420310567021483361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.590 × 10⁹⁸(99-digit number)
15903595615439231187…24840621134042966721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.180 × 10⁹⁸(99-digit number)
31807191230878462374…49681242268085933441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.361 × 10⁹⁸(99-digit number)
63614382461756924748…99362484536171866881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.272 × 10⁹⁹(100-digit number)
12722876492351384949…98724969072343733761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.544 × 10⁹⁹(100-digit number)
25445752984702769899…97449938144687467521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.089 × 10⁹⁹(100-digit number)
50891505969405539798…94899876289374935041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.017 × 10¹⁰⁰(101-digit number)
10178301193881107959…89799752578749870081
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,697,052 XPM·at block #6,806,618 · 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