Block #427,311

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 7:19:37 AM · Difficulty 10.3470 · 6,385,384 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
71a34fb2073a801caa44290bb25e37b4f6f7c214ff6dde167f85199cc6308187

Height

#427,311

Difficulty

10.346955

Transactions

2

Size

1.17 KB

Version

2

Bits

0a58d210

Nonce

163,853

Timestamp

3/3/2014, 7:19:37 AM

Confirmations

6,385,384

Merkle Root

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

4.337 × 10⁹⁸(99-digit number)
43376742121106584271…18250924527001845761
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
4.337 × 10⁹⁸(99-digit number)
43376742121106584271…18250924527001845761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.675 × 10⁹⁸(99-digit number)
86753484242213168542…36501849054003691521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.735 × 10⁹⁹(100-digit number)
17350696848442633708…73003698108007383041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.470 × 10⁹⁹(100-digit number)
34701393696885267416…46007396216014766081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.940 × 10⁹⁹(100-digit number)
69402787393770534833…92014792432029532161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.388 × 10¹⁰⁰(101-digit number)
13880557478754106966…84029584864059064321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.776 × 10¹⁰⁰(101-digit number)
27761114957508213933…68059169728118128641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.552 × 10¹⁰⁰(101-digit number)
55522229915016427867…36118339456236257281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.110 × 10¹⁰¹(102-digit number)
11104445983003285573…72236678912472514561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.220 × 10¹⁰¹(102-digit number)
22208891966006571146…44473357824945029121
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,745,596 XPM·at block #6,812,694 · 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