1. #6,809,5241CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #492,003

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 8:23:21 PM · Difficulty 10.6874 · 6,317,522 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
87aa7798bd2e0b37d7204b658488a0a0175e9a7a4a38520b89d4a4de16fa20da

Height

#492,003

Difficulty

10.687364

Transactions

4

Size

1.09 KB

Version

2

Bits

0aaff70f

Nonce

251,659,296

Timestamp

4/14/2014, 8:23:21 PM

Confirmations

6,317,522

Merkle Root

8cf9bcf8dc160b9e7df30e3a7e2e39dbf44c142c642e1afe8b78d3b77f586d2f
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.

2.982 × 10⁹⁶(97-digit number)
29823566307264458581…60649434056126591999
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
2.982 × 10⁹⁶(97-digit number)
29823566307264458581…60649434056126591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.964 × 10⁹⁶(97-digit number)
59647132614528917162…21298868112253183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.192 × 10⁹⁷(98-digit number)
11929426522905783432…42597736224506367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.385 × 10⁹⁷(98-digit number)
23858853045811566865…85195472449012735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.771 × 10⁹⁷(98-digit number)
47717706091623133730…70390944898025471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.543 × 10⁹⁷(98-digit number)
95435412183246267460…40781889796050943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.908 × 10⁹⁸(99-digit number)
19087082436649253492…81563779592101887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.817 × 10⁹⁸(99-digit number)
38174164873298506984…63127559184203775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.634 × 10⁹⁸(99-digit number)
76348329746597013968…26255118368407551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.526 × 10⁹⁹(100-digit number)
15269665949319402793…52510236736815103999
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,720,277 XPM·at block #6,809,524 · 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