1. #6,807,9522CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #449,083

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/18/2014, 9:12:35 AM · Difficulty 10.3671 · 6,358,870 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3ab29c5d0f24c16492e1336b7c71acf4a154cae0d5b75cf19b1e962ceeee64ed

Height

#449,083

Difficulty

10.367058

Transactions

7

Size

2.46 KB

Version

2

Bits

0a5df78b

Nonce

45,687

Timestamp

3/18/2014, 9:12:35 AM

Confirmations

6,358,870

Merkle Root

e2473492c370eb74b69b06176c3523f696cb0328cf48285c1a153967446be51a
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.508 × 10⁹⁶(97-digit number)
15083300963191222289…33052084475889717699
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.508 × 10⁹⁶(97-digit number)
15083300963191222289…33052084475889717699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.016 × 10⁹⁶(97-digit number)
30166601926382444578…66104168951779435399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.033 × 10⁹⁶(97-digit number)
60333203852764889156…32208337903558870799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.206 × 10⁹⁷(98-digit number)
12066640770552977831…64416675807117741599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.413 × 10⁹⁷(98-digit number)
24133281541105955662…28833351614235483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.826 × 10⁹⁷(98-digit number)
48266563082211911324…57666703228470966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.653 × 10⁹⁷(98-digit number)
96533126164423822649…15333406456941932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.930 × 10⁹⁸(99-digit number)
19306625232884764529…30666812913883865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.861 × 10⁹⁸(99-digit number)
38613250465769529059…61333625827767731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.722 × 10⁹⁸(99-digit number)
77226500931539058119…22667251655535462399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,707,665 XPM·at block #6,807,952 · 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