1. #6,809,8642CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #523,254

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2014, 12:14:40 PM · Difficulty 10.8710 · 6,286,611 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5cbdc788f408a3badc809755a3469f7a737a7eeb735869532e6c3a5d2290c317

Height

#523,254

Difficulty

10.870978

Transactions

3

Size

1.44 KB

Version

2

Bits

0adef867

Nonce

8,613

Timestamp

5/3/2014, 12:14:40 PM

Confirmations

6,286,611

Merkle Root

932399bfe5c6493b77a402624d4722dd11ae553450c15f350494802d658b949b
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.

1.429 × 10⁹⁹(100-digit number)
14293134246660342114…70204005479592634961
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
1.429 × 10⁹⁹(100-digit number)
14293134246660342114…70204005479592634961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.858 × 10⁹⁹(100-digit number)
28586268493320684229…40408010959185269921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.717 × 10⁹⁹(100-digit number)
57172536986641368458…80816021918370539841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.143 × 10¹⁰⁰(101-digit number)
11434507397328273691…61632043836741079681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.286 × 10¹⁰⁰(101-digit number)
22869014794656547383…23264087673482159361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.573 × 10¹⁰⁰(101-digit number)
45738029589313094766…46528175346964318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.147 × 10¹⁰⁰(101-digit number)
91476059178626189532…93056350693928637441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.829 × 10¹⁰¹(102-digit number)
18295211835725237906…86112701387857274881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.659 × 10¹⁰¹(102-digit number)
36590423671450475813…72225402775714549761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.318 × 10¹⁰¹(102-digit number)
73180847342900951626…44450805551429099521
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,723,008 XPM·at block #6,809,864 · 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