Block #526,726

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2014, 1:59:54 PM · Difficulty 10.8831 · 6,298,413 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5be0751ae06e65309a97035fc3dacf51ff2926f8c3079a87840554778ab3c6ed

Height

#526,726

Difficulty

10.883050

Transactions

6

Size

1.60 KB

Version

2

Bits

0ae20f92

Nonce

51,847,489

Timestamp

5/5/2014, 1:59:54 PM

Confirmations

6,298,413

Merkle Root

474b3f69eb65a6a7c2c69e875064034b26d1e304f35d07c5434197281f8525c2
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.898 × 10⁹⁹(100-digit number)
28980613849418006281…95377364256208337279
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.898 × 10⁹⁹(100-digit number)
28980613849418006281…95377364256208337279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.796 × 10⁹⁹(100-digit number)
57961227698836012563…90754728512416674559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.159 × 10¹⁰⁰(101-digit number)
11592245539767202512…81509457024833349119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.318 × 10¹⁰⁰(101-digit number)
23184491079534405025…63018914049666698239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.636 × 10¹⁰⁰(101-digit number)
46368982159068810050…26037828099333396479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.273 × 10¹⁰⁰(101-digit number)
92737964318137620100…52075656198666792959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.854 × 10¹⁰¹(102-digit number)
18547592863627524020…04151312397333585919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.709 × 10¹⁰¹(102-digit number)
37095185727255048040…08302624794667171839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.419 × 10¹⁰¹(102-digit number)
74190371454510096080…16605249589334343679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.483 × 10¹⁰²(103-digit number)
14838074290902019216…33210499178668687359
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,845,198 XPM·at block #6,825,138 · 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