Block #526,255

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/5/2014, 6:46:20 AM · Difficulty 10.8821 · 6,288,211 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
16790d21c09665553e197d18986a0fe3aae1f7b32caa573df6d843b44595633a

Height

#526,255

Difficulty

10.882056

Transactions

3

Size

660 B

Version

2

Bits

0ae1ce68

Nonce

99,436,777

Timestamp

5/5/2014, 6:46:20 AM

Confirmations

6,288,211

Merkle Root

0ff0ea2a83f0e198d2dec8ad209d01addda7edc6cc8099f91f6ee9dcf35d03ac
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.096 × 10⁹⁹(100-digit number)
20968145568751191666…77459259006223500001
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.096 × 10⁹⁹(100-digit number)
20968145568751191666…77459259006223500001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.193 × 10⁹⁹(100-digit number)
41936291137502383333…54918518012447000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.387 × 10⁹⁹(100-digit number)
83872582275004766666…09837036024894000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.677 × 10¹⁰⁰(101-digit number)
16774516455000953333…19674072049788000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.354 × 10¹⁰⁰(101-digit number)
33549032910001906666…39348144099576000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.709 × 10¹⁰⁰(101-digit number)
67098065820003813333…78696288199152000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.341 × 10¹⁰¹(102-digit number)
13419613164000762666…57392576398304000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.683 × 10¹⁰¹(102-digit number)
26839226328001525333…14785152796608000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.367 × 10¹⁰¹(102-digit number)
53678452656003050666…29570305593216000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.073 × 10¹⁰²(103-digit number)
10735690531200610133…59140611186432000001
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,759,801 XPM·at block #6,814,465 · 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