1. #6,809,9911CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #311,468

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 2:14:29 PM · Difficulty 9.9955 · 6,498,524 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f1acec9cb436c9cfb82778d0c240e5f811ba826a87a495a68d13bde98745866c

Height

#311,468

Difficulty

9.995483

Transactions

1

Size

1.11 KB

Version

2

Bits

09fed7f5

Nonce

41,550

Timestamp

12/14/2013, 2:14:29 PM

Confirmations

6,498,524

Merkle Root

9b9040ea1399502f0380409a4d7a3b81b381f75e9b4a4731c2010f5e098b1a1a
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.

8.736 × 10⁹²(93-digit number)
87360663264434840066…11216727352633732699
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
8.736 × 10⁹²(93-digit number)
87360663264434840066…11216727352633732699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.747 × 10⁹³(94-digit number)
17472132652886968013…22433454705267465399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.494 × 10⁹³(94-digit number)
34944265305773936026…44866909410534930799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.988 × 10⁹³(94-digit number)
69888530611547872053…89733818821069861599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.397 × 10⁹⁴(95-digit number)
13977706122309574410…79467637642139723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.795 × 10⁹⁴(95-digit number)
27955412244619148821…58935275284279446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.591 × 10⁹⁴(95-digit number)
55910824489238297642…17870550568558892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.118 × 10⁹⁵(96-digit number)
11182164897847659528…35741101137117785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.236 × 10⁹⁵(96-digit number)
22364329795695319057…71482202274235571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.472 × 10⁹⁵(96-digit number)
44728659591390638114…42964404548471142399
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,724,010 XPM·at block #6,809,991 · 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