1. #6,809,2412CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #493,562

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 6:12:20 PM · Difficulty 10.7030 · 6,315,680 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e609afa81c56f9f08e47fd153fcd5d8f8f9c62669425c6c47a81b3c039f1866

Height

#493,562

Difficulty

10.702973

Transactions

7

Size

1.49 KB

Version

2

Bits

0ab3f605

Nonce

54,203

Timestamp

4/15/2014, 6:12:20 PM

Confirmations

6,315,680

Merkle Root

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

5.301 × 10⁹⁶(97-digit number)
53017973686470898944…32241787802263316399
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
5.301 × 10⁹⁶(97-digit number)
53017973686470898944…32241787802263316399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.060 × 10⁹⁷(98-digit number)
10603594737294179788…64483575604526632799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.120 × 10⁹⁷(98-digit number)
21207189474588359577…28967151209053265599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.241 × 10⁹⁷(98-digit number)
42414378949176719155…57934302418106531199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.482 × 10⁹⁷(98-digit number)
84828757898353438310…15868604836213062399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.696 × 10⁹⁸(99-digit number)
16965751579670687662…31737209672426124799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.393 × 10⁹⁸(99-digit number)
33931503159341375324…63474419344852249599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.786 × 10⁹⁸(99-digit number)
67863006318682750648…26948838689704499199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.357 × 10⁹⁹(100-digit number)
13572601263736550129…53897677379408998399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.714 × 10⁹⁹(100-digit number)
27145202527473100259…07795354758817996799
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,718,001 XPM·at block #6,809,241 · 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