Block #439,711

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 9:16:05 PM · Difficulty 10.3601 · 6,366,963 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b03580c10b50d98b31c8d08f7848d708c6cea9ca6b3b640cccea8ae20f304e9

Height

#439,711

Difficulty

10.360070

Transactions

2

Size

1.42 KB

Version

2

Bits

0a5c2d8b

Nonce

53,049

Timestamp

3/11/2014, 9:16:05 PM

Confirmations

6,366,963

Merkle Root

6a28cea020b7777cf8d338f2ffd299b7b051908b85c7df26af78deff19a1386e
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.021 × 10⁹⁹(100-digit number)
10216281322697182372…69771262372520385921
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.021 × 10⁹⁹(100-digit number)
10216281322697182372…69771262372520385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.043 × 10⁹⁹(100-digit number)
20432562645394364745…39542524745040771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.086 × 10⁹⁹(100-digit number)
40865125290788729490…79085049490081543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.173 × 10⁹⁹(100-digit number)
81730250581577458980…58170098980163087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.634 × 10¹⁰⁰(101-digit number)
16346050116315491796…16340197960326174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.269 × 10¹⁰⁰(101-digit number)
32692100232630983592…32680395920652349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.538 × 10¹⁰⁰(101-digit number)
65384200465261967184…65360791841304698881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.307 × 10¹⁰¹(102-digit number)
13076840093052393436…30721583682609397761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.615 × 10¹⁰¹(102-digit number)
26153680186104786873…61443167365218795521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.230 × 10¹⁰¹(102-digit number)
52307360372209573747…22886334730437591041
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,484 XPM·at block #6,806,673 · 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