Block #579,753

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/7/2014, 4:21:05 AM · Difficulty 10.9664 · 6,233,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32973dd5f97e372cdb57015de4cb759e732e90ae16c80f8218fb1600f190aa2f

Height

#579,753

Difficulty

10.966376

Transactions

5

Size

1.95 KB

Version

2

Bits

0af7646e

Nonce

222,428,251

Timestamp

6/7/2014, 4:21:05 AM

Confirmations

6,233,248

Merkle Root

b47da05eb0fddc088e7429ecaf557a3b1a064be829f434cb2117c06484a03c6b
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.125 × 10⁹⁹(100-digit number)
31253006825688736143…20350202473906851841
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.125 × 10⁹⁹(100-digit number)
31253006825688736143…20350202473906851841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.250 × 10⁹⁹(100-digit number)
62506013651377472286…40700404947813703681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.250 × 10¹⁰⁰(101-digit number)
12501202730275494457…81400809895627407361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.500 × 10¹⁰⁰(101-digit number)
25002405460550988914…62801619791254814721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.000 × 10¹⁰⁰(101-digit number)
50004810921101977828…25603239582509629441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.000 × 10¹⁰¹(102-digit number)
10000962184220395565…51206479165019258881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.000 × 10¹⁰¹(102-digit number)
20001924368440791131…02412958330038517761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.000 × 10¹⁰¹(102-digit number)
40003848736881582263…04825916660077035521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.000 × 10¹⁰¹(102-digit number)
80007697473763164526…09651833320154071041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.600 × 10¹⁰²(103-digit number)
16001539494752632905…19303666640308142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.200 × 10¹⁰²(103-digit number)
32003078989505265810…38607333280616284161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,748,048 XPM·at block #6,813,000 · 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