1. #6,808,3811CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #541,208

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/13/2014, 10:25:09 AM · Difficulty 10.9381 · 6,267,173 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3f849d642a7c7e6ed2a1e27e5c13c27129175a34d1b7027d0285d16164561b83

Height

#541,208

Difficulty

10.938079

Transactions

2

Size

614 B

Version

2

Bits

0af025f0

Nonce

15,487,846

Timestamp

5/13/2014, 10:25:09 AM

Confirmations

6,267,173

Merkle Root

a61e2c6129894bcb80e9db6a0a84ddb8c814d40af880f5ce3213f8f0af004c18
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.282 × 10¹⁰⁰(101-digit number)
12824788547196164304…75015426006966131201
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.282 × 10¹⁰⁰(101-digit number)
12824788547196164304…75015426006966131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.564 × 10¹⁰⁰(101-digit number)
25649577094392328609…50030852013932262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.129 × 10¹⁰⁰(101-digit number)
51299154188784657219…00061704027864524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.025 × 10¹⁰¹(102-digit number)
10259830837756931443…00123408055729049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.051 × 10¹⁰¹(102-digit number)
20519661675513862887…00246816111458099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.103 × 10¹⁰¹(102-digit number)
41039323351027725775…00493632222916198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.207 × 10¹⁰¹(102-digit number)
82078646702055451551…00987264445832396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.641 × 10¹⁰²(103-digit number)
16415729340411090310…01974528891664793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.283 × 10¹⁰²(103-digit number)
32831458680822180620…03949057783329587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.566 × 10¹⁰²(103-digit number)
65662917361644361241…07898115566659174401
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,711,102 XPM·at block #6,808,380 · 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