Block #589,728

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/15/2014, 5:14:17 PM · Difficulty 10.9471 · 6,226,818 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f4af2bf2d78d472fa7f84c78d8f97c93cdd5f5f9e2cbb4504db5d0dbe25e99e4

Height

#589,728

Difficulty

10.947143

Transactions

3

Size

1.08 KB

Version

2

Bits

0af277f9

Nonce

55,253,971

Timestamp

6/15/2014, 5:14:17 PM

Confirmations

6,226,818

Merkle Root

d830755ba2985cc4870e6d3a4ca728f285dbe6d5eba18ffef15dbf746c795eaf
Transactions (3)
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.

2.021 × 10⁹⁸(99-digit number)
20219855019040097214…78802889306891193919
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
2.021 × 10⁹⁸(99-digit number)
20219855019040097214…78802889306891193919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.043 × 10⁹⁸(99-digit number)
40439710038080194428…57605778613782387839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.087 × 10⁹⁸(99-digit number)
80879420076160388857…15211557227564775679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.617 × 10⁹⁹(100-digit number)
16175884015232077771…30423114455129551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.235 × 10⁹⁹(100-digit number)
32351768030464155542…60846228910259102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.470 × 10⁹⁹(100-digit number)
64703536060928311085…21692457820518205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.294 × 10¹⁰⁰(101-digit number)
12940707212185662217…43384915641036410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.588 × 10¹⁰⁰(101-digit number)
25881414424371324434…86769831282072821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.176 × 10¹⁰⁰(101-digit number)
51762828848742648868…73539662564145643519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.035 × 10¹⁰¹(102-digit number)
10352565769748529773…47079325128291287039
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,776,497 XPM·at block #6,816,545 · 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