Block #530,517

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2014, 10:19:43 PM · Difficulty 10.8923 · 6,285,618 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
946e74703f54613bd51e3fc9610dc780f0ed6d797b6046c790d117c37392b0ed

Height

#530,517

Difficulty

10.892344

Transactions

4

Size

886 B

Version

2

Bits

0ae470ad

Nonce

65,138,609

Timestamp

5/7/2014, 10:19:43 PM

Confirmations

6,285,618

Merkle Root

82e035f7d5ad8f49e96601fe5ae75e1f2254336816a0c6a3f46c1e164718ac0c
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.

4.200 × 10⁹⁹(100-digit number)
42004970267899803313…49947720452937196641
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
4.200 × 10⁹⁹(100-digit number)
42004970267899803313…49947720452937196641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.400 × 10⁹⁹(100-digit number)
84009940535799606627…99895440905874393281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.680 × 10¹⁰⁰(101-digit number)
16801988107159921325…99790881811748786561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.360 × 10¹⁰⁰(101-digit number)
33603976214319842650…99581763623497573121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.720 × 10¹⁰⁰(101-digit number)
67207952428639685301…99163527246995146241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.344 × 10¹⁰¹(102-digit number)
13441590485727937060…98327054493990292481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.688 × 10¹⁰¹(102-digit number)
26883180971455874120…96654108987980584961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.376 × 10¹⁰¹(102-digit number)
53766361942911748241…93308217975961169921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.075 × 10¹⁰²(103-digit number)
10753272388582349648…86616435951922339841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.150 × 10¹⁰²(103-digit number)
21506544777164699296…73232871903844679681
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,773,206 XPM·at block #6,816,134 · 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