1. #6,807,9872CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #972,103

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/13/2015, 6:51:41 AM · Difficulty 10.8395 · 5,835,885 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
773f9b8a26aa0c0f11f0d1bd453170a6f9ac7e57324183efefb0cf6434fa2318

Height

#972,103

Difficulty

10.839504

Transactions

7

Size

1.96 KB

Version

2

Bits

0ad6e9b5

Nonce

27,725,637

Timestamp

3/13/2015, 6:51:41 AM

Confirmations

5,835,885

Merkle Root

064ff350a55c2bc8404bb3260b545e7d91a0d068ca55e9c6300efca0a0c22e05
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.455 × 10⁹⁶(97-digit number)
24555195560546981985…70783271391315087359
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.455 × 10⁹⁶(97-digit number)
24555195560546981985…70783271391315087359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.911 × 10⁹⁶(97-digit number)
49110391121093963971…41566542782630174719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.822 × 10⁹⁶(97-digit number)
98220782242187927943…83133085565260349439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.964 × 10⁹⁷(98-digit number)
19644156448437585588…66266171130520698879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.928 × 10⁹⁷(98-digit number)
39288312896875171177…32532342261041397759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.857 × 10⁹⁷(98-digit number)
78576625793750342354…65064684522082795519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.571 × 10⁹⁸(99-digit number)
15715325158750068470…30129369044165591039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.143 × 10⁹⁸(99-digit number)
31430650317500136941…60258738088331182079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.286 × 10⁹⁸(99-digit number)
62861300635000273883…20517476176662364159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.257 × 10⁹⁹(100-digit number)
12572260127000054776…41034952353324728319
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,951 XPM·at block #6,807,987 · 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