1. #6,807,6092CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #488,856

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/12/2014, 10:49:33 PM · Difficulty 10.6603 · 6,318,754 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7c5a9c568a6fa6f382f9a3b321953cfa2651f58e88181968a90bb0d87e72b91d

Height

#488,856

Difficulty

10.660338

Transactions

5

Size

1.40 KB

Version

2

Bits

0aa90be7

Nonce

277,786

Timestamp

4/12/2014, 10:49:33 PM

Confirmations

6,318,754

Merkle Root

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

6.245 × 10¹⁰⁰(101-digit number)
62453595559625301390…77717778666243011681
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
6.245 × 10¹⁰⁰(101-digit number)
62453595559625301390…77717778666243011681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.249 × 10¹⁰¹(102-digit number)
12490719111925060278…55435557332486023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.498 × 10¹⁰¹(102-digit number)
24981438223850120556…10871114664972046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.996 × 10¹⁰¹(102-digit number)
49962876447700241112…21742229329944093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.992 × 10¹⁰¹(102-digit number)
99925752895400482224…43484458659888186881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.998 × 10¹⁰²(103-digit number)
19985150579080096444…86968917319776373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.997 × 10¹⁰²(103-digit number)
39970301158160192889…73937834639552747521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.994 × 10¹⁰²(103-digit number)
79940602316320385779…47875669279105495041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.598 × 10¹⁰³(104-digit number)
15988120463264077155…95751338558210990081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.197 × 10¹⁰³(104-digit number)
31976240926528154311…91502677116421980161
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,704,910 XPM·at block #6,807,609 · 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