Block #534,132

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2014, 3:16:08 AM · Difficulty 10.9015 · 6,276,994 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4b7cd5791adbb7545a56a7f7ee68ae2fee8de050fd3f3d60051349f68eb91b41

Height

#534,132

Difficulty

10.901465

Transactions

6

Size

1.74 KB

Version

2

Bits

0ae6c669

Nonce

1,305,110

Timestamp

5/10/2014, 3:16:08 AM

Confirmations

6,276,994

Merkle Root

5cb7a6ef635a3e6d047d42d2d6d514e7621cc830dbba00b68e99f5a071453cd5
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.535 × 10¹⁰¹(102-digit number)
15359568286916464808…83136893706081996801
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.535 × 10¹⁰¹(102-digit number)
15359568286916464808…83136893706081996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.071 × 10¹⁰¹(102-digit number)
30719136573832929616…66273787412163993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.143 × 10¹⁰¹(102-digit number)
61438273147665859232…32547574824327987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.228 × 10¹⁰²(103-digit number)
12287654629533171846…65095149648655974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.457 × 10¹⁰²(103-digit number)
24575309259066343693…30190299297311948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.915 × 10¹⁰²(103-digit number)
49150618518132687386…60380598594623897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.830 × 10¹⁰²(103-digit number)
98301237036265374772…20761197189247795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.966 × 10¹⁰³(104-digit number)
19660247407253074954…41522394378495590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.932 × 10¹⁰³(104-digit number)
39320494814506149909…83044788756991180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.864 × 10¹⁰³(104-digit number)
78640989629012299818…66089577513982361601
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,733,115 XPM·at block #6,811,125 · 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