Block #585,670

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/12/2014, 10:17:06 AM · Difficulty 10.9537 · 6,224,425 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b222f53ddcb020dd299d539972e6f972ec06ba8afcde967339554535a8e546de

Height

#585,670

Difficulty

10.953686

Transactions

11

Size

11.62 KB

Version

2

Bits

0af424ca

Nonce

134,250

Timestamp

6/12/2014, 10:17:06 AM

Confirmations

6,224,425

Merkle Root

2b4bfbe07048561f4d43102b6593fb13345063b199f931952fac9c245cd74b00
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.154 × 10⁹⁹(100-digit number)
11545308479672144077…96174885324205240321
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.154 × 10⁹⁹(100-digit number)
11545308479672144077…96174885324205240321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.309 × 10⁹⁹(100-digit number)
23090616959344288155…92349770648410480641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.618 × 10⁹⁹(100-digit number)
46181233918688576310…84699541296820961281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.236 × 10⁹⁹(100-digit number)
92362467837377152620…69399082593641922561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.847 × 10¹⁰⁰(101-digit number)
18472493567475430524…38798165187283845121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.694 × 10¹⁰⁰(101-digit number)
36944987134950861048…77596330374567690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.388 × 10¹⁰⁰(101-digit number)
73889974269901722096…55192660749135380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.477 × 10¹⁰¹(102-digit number)
14777994853980344419…10385321498270760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.955 × 10¹⁰¹(102-digit number)
29555989707960688838…20770642996541521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.911 × 10¹⁰¹(102-digit number)
59111979415921377676…41541285993083043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.182 × 10¹⁰²(103-digit number)
11822395883184275535…83082571986166087681
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,724,835 XPM·at block #6,810,094 · 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