Block #589,646

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/15/2014, 3:33:37 PM · Difficulty 10.9473 · 6,220,158 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d9f6e5794511ee83a38833dcdcf898b5db00c7d23a1f08cdf21986ad8e4a830b

Height

#589,646

Difficulty

10.947322

Transactions

1

Size

244 B

Version

2

Bits

0af283ab

Nonce

180,893,786

Timestamp

6/15/2014, 3:33:37 PM

Confirmations

6,220,158

Merkle Root

e7a1b67459a625def600b9e7bd3c5bd9e9943baa7cec8e7c2f35ca108b082cbe
Transactions (1)
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.992 × 10⁹⁹(100-digit number)
19928158055512625386…09969920841550202879
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.992 × 10⁹⁹(100-digit number)
19928158055512625386…09969920841550202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.985 × 10⁹⁹(100-digit number)
39856316111025250773…19939841683100405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.971 × 10⁹⁹(100-digit number)
79712632222050501547…39879683366200811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.594 × 10¹⁰⁰(101-digit number)
15942526444410100309…79759366732401623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.188 × 10¹⁰⁰(101-digit number)
31885052888820200618…59518733464803246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.377 × 10¹⁰⁰(101-digit number)
63770105777640401237…19037466929606492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.275 × 10¹⁰¹(102-digit number)
12754021155528080247…38074933859212984319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.550 × 10¹⁰¹(102-digit number)
25508042311056160495…76149867718425968639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.101 × 10¹⁰¹(102-digit number)
51016084622112320990…52299735436851937279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.020 × 10¹⁰²(103-digit number)
10203216924422464198…04599470873703874559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.040 × 10¹⁰²(103-digit number)
20406433848844928396…09198941747407749119
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,722,514 XPM·at block #6,809,803 · 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