1. #6,807,8462CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #425,712

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/2/2014, 3:11:01 AM · Difficulty 10.3575 · 6,382,135 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a16c8a0251b0331e2909343d6510856950fa398b7f2c439767ee82d64ab49703

Height

#425,712

Difficulty

10.357532

Transactions

8

Size

2.41 KB

Version

2

Bits

0a5b8730

Nonce

3,775

Timestamp

3/2/2014, 3:11:01 AM

Confirmations

6,382,135

Merkle Root

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

7.578 × 10⁹⁹(100-digit number)
75789046983289385889…22325685154543466241
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
7.578 × 10⁹⁹(100-digit number)
75789046983289385889…22325685154543466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.515 × 10¹⁰⁰(101-digit number)
15157809396657877177…44651370309086932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.031 × 10¹⁰⁰(101-digit number)
30315618793315754355…89302740618173864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.063 × 10¹⁰⁰(101-digit number)
60631237586631508711…78605481236347729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.212 × 10¹⁰¹(102-digit number)
12126247517326301742…57210962472695459841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.425 × 10¹⁰¹(102-digit number)
24252495034652603484…14421924945390919681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.850 × 10¹⁰¹(102-digit number)
48504990069305206969…28843849890781839361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.700 × 10¹⁰¹(102-digit number)
97009980138610413939…57687699781563678721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.940 × 10¹⁰²(103-digit number)
19401996027722082787…15375399563127357441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.880 × 10¹⁰²(103-digit number)
38803992055444165575…30750799126254714881
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,706,815 XPM·at block #6,807,846 · 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