Block #528,869

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/6/2014, 9:47:49 PM · Difficulty 10.8885 · 6,298,487 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fbd0f51d76aa36ef4da5da909cc74b0cb93e16beffdfe0013bbcd75183c2838a

Height

#528,869

Difficulty

10.888457

Transactions

3

Size

652 B

Version

2

Bits

0ae371e4

Nonce

397,017,935

Timestamp

5/6/2014, 9:47:49 PM

Confirmations

6,298,487

Merkle Root

b21a363f9dd0849fd972ac716cfa3dd0247b99d599de84944057307afbd96c94
Transactions (3)
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.

6.264 × 10⁹⁷(98-digit number)
62646479167709991682…75177932578986879999
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
6.264 × 10⁹⁷(98-digit number)
62646479167709991682…75177932578986879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.252 × 10⁹⁸(99-digit number)
12529295833541998336…50355865157973759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.505 × 10⁹⁸(99-digit number)
25058591667083996672…00711730315947519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.011 × 10⁹⁸(99-digit number)
50117183334167993345…01423460631895039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.002 × 10⁹⁹(100-digit number)
10023436666833598669…02846921263790079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.004 × 10⁹⁹(100-digit number)
20046873333667197338…05693842527580159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.009 × 10⁹⁹(100-digit number)
40093746667334394676…11387685055160319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.018 × 10⁹⁹(100-digit number)
80187493334668789353…22775370110320639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.603 × 10¹⁰⁰(101-digit number)
16037498666933757870…45550740220641279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.207 × 10¹⁰⁰(101-digit number)
32074997333867515741…91101480441282559999
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,862,946 XPM·at block #6,827,355 · 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