Block #531,666

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/8/2014, 3:37:45 PM · Difficulty 10.8947 · 6,295,416 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fdf73d7312064c8cd5273f613c0ff5992df8b10644f9ab45b66cdc019d3aa2f3

Height

#531,666

Difficulty

10.894744

Transactions

5

Size

1.51 KB

Version

2

Bits

0ae50df3

Nonce

1,772,958,987

Timestamp

5/8/2014, 3:37:45 PM

Confirmations

6,295,416

Merkle Root

095cbfc7e7ceed0c877d1b7898a9a95a074bde5045ad487a91241089cd3b2487
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.

1.053 × 10⁸⁸(89-digit number)
10533711009760403099…33836745227570648479
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
1.053 × 10⁸⁸(89-digit number)
10533711009760403099…33836745227570648479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.106 × 10⁸⁸(89-digit number)
21067422019520806198…67673490455141296959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.213 × 10⁸⁸(89-digit number)
42134844039041612397…35346980910282593919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.426 × 10⁸⁸(89-digit number)
84269688078083224795…70693961820565187839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.685 × 10⁸⁹(90-digit number)
16853937615616644959…41387923641130375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.370 × 10⁸⁹(90-digit number)
33707875231233289918…82775847282260751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.741 × 10⁸⁹(90-digit number)
67415750462466579836…65551694564521502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.348 × 10⁹⁰(91-digit number)
13483150092493315967…31103389129043005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.696 × 10⁹⁰(91-digit number)
26966300184986631934…62206778258086010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.393 × 10⁹⁰(91-digit number)
53932600369973263868…24413556516172021759
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,860,841 XPM·at block #6,827,081 · 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