Block #529,515

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2014, 7:21:27 AM · Difficulty 10.8901 · 6,287,078 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b53cd2a340517cf749dba20b5c8673837571b427921c04d0d3ea8bf266054463

Height

#529,515

Difficulty

10.890064

Transactions

1

Size

802 B

Version

2

Bits

0ae3db3d

Nonce

160,074

Timestamp

5/7/2014, 7:21:27 AM

Confirmations

6,287,078

Merkle Root

5a88f1eff556a7380949c289874b31637a5bbe17505e2e1c09e86e3a58dfcc59
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.009 × 10¹⁰¹(102-digit number)
10090968784875462905…17590568804674797161
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.009 × 10¹⁰¹(102-digit number)
10090968784875462905…17590568804674797161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.018 × 10¹⁰¹(102-digit number)
20181937569750925810…35181137609349594321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.036 × 10¹⁰¹(102-digit number)
40363875139501851621…70362275218699188641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.072 × 10¹⁰¹(102-digit number)
80727750279003703243…40724550437398377281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.614 × 10¹⁰²(103-digit number)
16145550055800740648…81449100874796754561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.229 × 10¹⁰²(103-digit number)
32291100111601481297…62898201749593509121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.458 × 10¹⁰²(103-digit number)
64582200223202962595…25796403499187018241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.291 × 10¹⁰³(104-digit number)
12916440044640592519…51592806998374036481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.583 × 10¹⁰³(104-digit number)
25832880089281185038…03185613996748072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.166 × 10¹⁰³(104-digit number)
51665760178562370076…06371227993496145921
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,776,868 XPM·at block #6,816,592 · 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