Block #484,587

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2014, 3:07:20 PM · Difficulty 10.5907 · 6,325,328 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
263cfef8ab078209e08283412a0d0c56f1104ed9473707d2d34069c514435005

Height

#484,587

Difficulty

10.590744

Transactions

6

Size

1.45 KB

Version

2

Bits

0a973afa

Nonce

497,363,248

Timestamp

4/10/2014, 3:07:20 PM

Confirmations

6,325,328

Merkle Root

a56beee7112a43bd1965d2ed5b3fbf9eb44a6454fe366343c08690e64cc9e8e3
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.685 × 10⁹⁸(99-digit number)
16854731283625604846…04440410064360309199
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.685 × 10⁹⁸(99-digit number)
16854731283625604846…04440410064360309199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.370 × 10⁹⁸(99-digit number)
33709462567251209693…08880820128720618399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.741 × 10⁹⁸(99-digit number)
67418925134502419387…17761640257441236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.348 × 10⁹⁹(100-digit number)
13483785026900483877…35523280514882473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.696 × 10⁹⁹(100-digit number)
26967570053800967754…71046561029764947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.393 × 10⁹⁹(100-digit number)
53935140107601935509…42093122059529894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.078 × 10¹⁰⁰(101-digit number)
10787028021520387101…84186244119059788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.157 × 10¹⁰⁰(101-digit number)
21574056043040774203…68372488238119577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.314 × 10¹⁰⁰(101-digit number)
43148112086081548407…36744976476239155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.629 × 10¹⁰⁰(101-digit number)
86296224172163096815…73489952952478310399
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,723,404 XPM·at block #6,809,914 · 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