Block #578,330

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/5/2014, 11:28:19 PM · Difficulty 10.9683 · 6,238,237 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9c367035d582e5c5ff56f8b7cd10cffa5edef017fc0905c050646b6a0ce046c2

Height

#578,330

Difficulty

10.968333

Transactions

6

Size

1.59 KB

Version

2

Bits

0af7e4b0

Nonce

284,981,189

Timestamp

6/5/2014, 11:28:19 PM

Confirmations

6,238,237

Merkle Root

68065dc7028c7098bb1e86657674578b7cbdf686474f9fbebf3d2438c1cbf248
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.291 × 10⁹⁹(100-digit number)
12912428368321988377…79015129993642511361
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.291 × 10⁹⁹(100-digit number)
12912428368321988377…79015129993642511361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.582 × 10⁹⁹(100-digit number)
25824856736643976755…58030259987285022721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.164 × 10⁹⁹(100-digit number)
51649713473287953510…16060519974570045441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.032 × 10¹⁰⁰(101-digit number)
10329942694657590702…32121039949140090881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.065 × 10¹⁰⁰(101-digit number)
20659885389315181404…64242079898280181761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.131 × 10¹⁰⁰(101-digit number)
41319770778630362808…28484159796560363521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.263 × 10¹⁰⁰(101-digit number)
82639541557260725616…56968319593120727041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.652 × 10¹⁰¹(102-digit number)
16527908311452145123…13936639186241454081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.305 × 10¹⁰¹(102-digit number)
33055816622904290246…27873278372482908161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.611 × 10¹⁰¹(102-digit number)
66111633245808580493…55746556744965816321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.322 × 10¹⁰²(103-digit number)
13222326649161716098…11493113489931632641
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,776,667 XPM·at block #6,816,566 · 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