Block #533,802

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 10:24:43 PM · Difficulty 10.9007 · 6,282,821 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5a6f350baa896191eb41df53cc0b11d773cc4780a6da502b13cc8d5a5637d0a8

Height

#533,802

Difficulty

10.900695

Transactions

3

Size

1.19 KB

Version

2

Bits

0ae693f2

Nonce

70,051,239

Timestamp

5/9/2014, 10:24:43 PM

Confirmations

6,282,821

Merkle Root

45fcdf1d5141316b244b33bc21cf85d935ccca1c641feee318e6ed14b6284b66
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.

1.543 × 10¹⁰¹(102-digit number)
15438013472012053736…65651120994523432961
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.543 × 10¹⁰¹(102-digit number)
15438013472012053736…65651120994523432961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.087 × 10¹⁰¹(102-digit number)
30876026944024107472…31302241989046865921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.175 × 10¹⁰¹(102-digit number)
61752053888048214944…62604483978093731841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.235 × 10¹⁰²(103-digit number)
12350410777609642988…25208967956187463681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.470 × 10¹⁰²(103-digit number)
24700821555219285977…50417935912374927361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.940 × 10¹⁰²(103-digit number)
49401643110438571955…00835871824749854721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.880 × 10¹⁰²(103-digit number)
98803286220877143911…01671743649499709441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.976 × 10¹⁰³(104-digit number)
19760657244175428782…03343487298999418881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.952 × 10¹⁰³(104-digit number)
39521314488350857564…06686974597998837761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.904 × 10¹⁰³(104-digit number)
79042628976701715129…13373949195997675521
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,777,107 XPM·at block #6,816,622 · 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