Block #531,874

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/8/2014, 6:32:49 PM · Difficulty 10.8955 · 6,280,860 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a7452e308e7fba5b0cd250c6109f7ab5bde9b53a8c25acfe8e65ddac51eb36b0

Height

#531,874

Difficulty

10.895463

Transactions

4

Size

1.01 KB

Version

2

Bits

0ae53d0a

Nonce

20,646,751

Timestamp

5/8/2014, 6:32:49 PM

Confirmations

6,280,860

Merkle Root

f0bbbe01ccf3ec7ea465b3f7acd35d087061c6f4a7faa9c40c6f208f86a85f10
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.019 × 10⁹⁸(99-digit number)
90197863417740320126…46508403912660748799
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.019 × 10⁹⁸(99-digit number)
90197863417740320126…46508403912660748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.803 × 10⁹⁹(100-digit number)
18039572683548064025…93016807825321497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.607 × 10⁹⁹(100-digit number)
36079145367096128050…86033615650642995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.215 × 10⁹⁹(100-digit number)
72158290734192256101…72067231301285990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.443 × 10¹⁰⁰(101-digit number)
14431658146838451220…44134462602571980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.886 × 10¹⁰⁰(101-digit number)
28863316293676902440…88268925205143961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.772 × 10¹⁰⁰(101-digit number)
57726632587353804881…76537850410287923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.154 × 10¹⁰¹(102-digit number)
11545326517470760976…53075700820575846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.309 × 10¹⁰¹(102-digit number)
23090653034941521952…06151401641151692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.618 × 10¹⁰¹(102-digit number)
46181306069883043905…12302803282303385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.236 × 10¹⁰¹(102-digit number)
92362612139766087810…24605606564606771199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,745,913 XPM·at block #6,812,733 · 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