Block #441,520

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/13/2014, 5:02:35 AM · Difficulty 10.3485 · 6,367,350 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1073e4940b19d5080d25649534ce7549b8eb37325af51e93ffc1168072039c28

Height

#441,520

Difficulty

10.348545

Transactions

1

Size

1002 B

Version

2

Bits

0a593a39

Nonce

136,327

Timestamp

3/13/2014, 5:02:35 AM

Confirmations

6,367,350

Merkle Root

d5a076b6771d82eea72793c0beb92ba4840a01b56348a99fe4142752e46cb4ec
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.

5.061 × 10⁹³(94-digit number)
50617905301604245274…29230526332432521601
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
5.061 × 10⁹³(94-digit number)
50617905301604245274…29230526332432521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.012 × 10⁹⁴(95-digit number)
10123581060320849054…58461052664865043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.024 × 10⁹⁴(95-digit number)
20247162120641698109…16922105329730086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.049 × 10⁹⁴(95-digit number)
40494324241283396219…33844210659460172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.098 × 10⁹⁴(95-digit number)
80988648482566792438…67688421318920345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.619 × 10⁹⁵(96-digit number)
16197729696513358487…35376842637840691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.239 × 10⁹⁵(96-digit number)
32395459393026716975…70753685275681382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.479 × 10⁹⁵(96-digit number)
64790918786053433951…41507370551362764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.295 × 10⁹⁶(97-digit number)
12958183757210686790…83014741102725529601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.591 × 10⁹⁶(97-digit number)
25916367514421373580…66029482205451059201
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,715,010 XPM·at block #6,808,869 · 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