Block #586,165

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/12/2014, 7:54:36 PM · Difficulty 10.9529 · 6,221,830 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
35eba57a48e77073f2c69d55d7895d679e5b47ab3bfcae8b8d96c708fe9dd5b5

Height

#586,165

Difficulty

10.952937

Transactions

5

Size

1.23 KB

Version

2

Bits

0af3f3b4

Nonce

151,160,054

Timestamp

6/12/2014, 7:54:36 PM

Confirmations

6,221,830

Merkle Root

b0d4eeab63ba49113413e46f4e228d5e325a2c78bc86c0a765922318efd185d6
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.522 × 10⁹⁷(98-digit number)
35229347982414270857…99525186396956583681
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.522 × 10⁹⁷(98-digit number)
35229347982414270857…99525186396956583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.045 × 10⁹⁷(98-digit number)
70458695964828541714…99050372793913167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.409 × 10⁹⁸(99-digit number)
14091739192965708342…98100745587826334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.818 × 10⁹⁸(99-digit number)
28183478385931416685…96201491175652669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.636 × 10⁹⁸(99-digit number)
56366956771862833371…92402982351305338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.127 × 10⁹⁹(100-digit number)
11273391354372566674…84805964702610677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.254 × 10⁹⁹(100-digit number)
22546782708745133348…69611929405221355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.509 × 10⁹⁹(100-digit number)
45093565417490266697…39223858810442711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.018 × 10⁹⁹(100-digit number)
90187130834980533394…78447717620885422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.803 × 10¹⁰⁰(101-digit number)
18037426166996106678…56895435241770844161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.607 × 10¹⁰⁰(101-digit number)
36074852333992213357…13790870483541688321
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,707,999 XPM·at block #6,807,994 · 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