1. #6,825,1082CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #457,467

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 10:14:31 PM · Difficulty 10.4213 · 6,367,643 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e29f1d8e17c58deab00ecb0b623242e3d05b24fea82db86b08d0a124306eb6d0

Height

#457,467

Difficulty

10.421252

Transactions

3

Size

588 B

Version

2

Bits

0a6bd72c

Nonce

15,792

Timestamp

3/23/2014, 10:14:31 PM

Confirmations

6,367,643

Merkle Root

a91b845be200fc7fe76582cecfe96953d5b9ad3127b3d9848397fd4b98172073
Transactions (3)
1 in → 1 out9.2100 XPM110 B
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.

9.721 × 10⁹⁸(99-digit number)
97217000105482525818…03657044844911270401
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
9.721 × 10⁹⁸(99-digit number)
97217000105482525818…03657044844911270401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.944 × 10⁹⁹(100-digit number)
19443400021096505163…07314089689822540801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.888 × 10⁹⁹(100-digit number)
38886800042193010327…14628179379645081601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.777 × 10⁹⁹(100-digit number)
77773600084386020654…29256358759290163201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.555 × 10¹⁰⁰(101-digit number)
15554720016877204130…58512717518580326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.110 × 10¹⁰⁰(101-digit number)
31109440033754408261…17025435037160652801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.221 × 10¹⁰⁰(101-digit number)
62218880067508816523…34050870074321305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.244 × 10¹⁰¹(102-digit number)
12443776013501763304…68101740148642611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.488 × 10¹⁰¹(102-digit number)
24887552027003526609…36203480297285222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.977 × 10¹⁰¹(102-digit number)
49775104054007053219…72406960594570444801
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,844,961 XPM·at block #6,825,109 · 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.
Privacy Policy·

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