Block #527,828

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2014, 7:26:46 AM · Difficulty 10.8843 · 6,281,733 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5767186376d83971cb69f8156ebba0b3d21c76d2554fd2c0a5835f26064a73e1

Height

#527,828

Difficulty

10.884339

Transactions

6

Size

1.48 KB

Version

2

Bits

0ae26409

Nonce

14,717,455

Timestamp

5/6/2014, 7:26:46 AM

Confirmations

6,281,733

Merkle Root

b19ca6e58882ac321b54da74868f138540a6869d19272a5ea010b48f413990d1
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.080 × 10⁹⁸(99-digit number)
20803783290586278246…15583010901050190581
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.080 × 10⁹⁸(99-digit number)
20803783290586278246…15583010901050190581
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.160 × 10⁹⁸(99-digit number)
41607566581172556492…31166021802100381161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.321 × 10⁹⁸(99-digit number)
83215133162345112985…62332043604200762321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.664 × 10⁹⁹(100-digit number)
16643026632469022597…24664087208401524641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.328 × 10⁹⁹(100-digit number)
33286053264938045194…49328174416803049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.657 × 10⁹⁹(100-digit number)
66572106529876090388…98656348833606098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.331 × 10¹⁰⁰(101-digit number)
13314421305975218077…97312697667212197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.662 × 10¹⁰⁰(101-digit number)
26628842611950436155…94625395334424394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.325 × 10¹⁰⁰(101-digit number)
53257685223900872310…89250790668848788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.065 × 10¹⁰¹(102-digit number)
10651537044780174462…78501581337697576961
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,720,562 XPM·at block #6,809,560 · 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