1. #6,806,9592CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #320,556

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2013, 5:41:34 PM · Difficulty 10.1852 · 6,486,404 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0cacd9a4abcd38e028b7bca37f96283187c0f08b7c0eee6df971cdeb35fbfc35

Height

#320,556

Difficulty

10.185164

Transactions

4

Size

3.26 KB

Version

2

Bits

0a2f66eb

Nonce

205,530

Timestamp

12/19/2013, 5:41:34 PM

Confirmations

6,486,404

Merkle Root

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

3.113 × 10⁹⁷(98-digit number)
31135542456275852868…84354098553384098239
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
3.113 × 10⁹⁷(98-digit number)
31135542456275852868…84354098553384098239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.227 × 10⁹⁷(98-digit number)
62271084912551705736…68708197106768196479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.245 × 10⁹⁸(99-digit number)
12454216982510341147…37416394213536392959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.490 × 10⁹⁸(99-digit number)
24908433965020682294…74832788427072785919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.981 × 10⁹⁸(99-digit number)
49816867930041364589…49665576854145571839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.963 × 10⁹⁸(99-digit number)
99633735860082729178…99331153708291143679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.992 × 10⁹⁹(100-digit number)
19926747172016545835…98662307416582287359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.985 × 10⁹⁹(100-digit number)
39853494344033091671…97324614833164574719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.970 × 10⁹⁹(100-digit number)
79706988688066183342…94649229666329149439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.594 × 10¹⁰⁰(101-digit number)
15941397737613236668…89298459332658298879
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,699,778 XPM·at block #6,806,959 · 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