Block #531,707

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2014, 4:12:06 PM · Difficulty 10.8949 · 6,285,674 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab710f1139648213ac483259c505413bdaac5c3b5bacaae59a990d7099398b2e

Height

#531,707

Difficulty

10.894916

Transactions

6

Size

16.20 KB

Version

2

Bits

0ae51933

Nonce

3,177,346

Timestamp

5/8/2014, 4:12:06 PM

Confirmations

6,285,674

Merkle Root

b50aa1d3cbe02820e56f2b10609e3f3687de32025c003d8905dc6b93e4c03b93
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.

3.036 × 10⁹⁹(100-digit number)
30361769667650969988…49860824019226549921
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
3.036 × 10⁹⁹(100-digit number)
30361769667650969988…49860824019226549921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.072 × 10⁹⁹(100-digit number)
60723539335301939976…99721648038453099841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.214 × 10¹⁰⁰(101-digit number)
12144707867060387995…99443296076906199681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.428 × 10¹⁰⁰(101-digit number)
24289415734120775990…98886592153812399361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.857 × 10¹⁰⁰(101-digit number)
48578831468241551981…97773184307624798721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.715 × 10¹⁰⁰(101-digit number)
97157662936483103962…95546368615249597441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.943 × 10¹⁰¹(102-digit number)
19431532587296620792…91092737230499194881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.886 × 10¹⁰¹(102-digit number)
38863065174593241584…82185474460998389761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.772 × 10¹⁰¹(102-digit number)
77726130349186483169…64370948921996779521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.554 × 10¹⁰²(103-digit number)
15545226069837296633…28741897843993559041
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,783,089 XPM·at block #6,817,380 · 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