Block #488,377

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/12/2014, 4:21:59 PM · Difficulty 10.6538 · 6,329,101 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a19ae89e0ef25ccdae06bc40aee80d46467392f28feb6d7abe13ee279cf9947c

Height

#488,377

Difficulty

10.653791

Transactions

5

Size

1.89 KB

Version

2

Bits

0aa75ed8

Nonce

72,365

Timestamp

4/12/2014, 4:21:59 PM

Confirmations

6,329,101

Merkle Root

8164a54c2a63066d90cbb57bbdbf177a3be8e047d6a06791be0146777e04e157
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.889 × 10⁹⁶(97-digit number)
28894744270402555946…70660591497624423999
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.889 × 10⁹⁶(97-digit number)
28894744270402555946…70660591497624423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.778 × 10⁹⁶(97-digit number)
57789488540805111892…41321182995248847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.155 × 10⁹⁷(98-digit number)
11557897708161022378…82642365990497695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.311 × 10⁹⁷(98-digit number)
23115795416322044757…65284731980995391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.623 × 10⁹⁷(98-digit number)
46231590832644089514…30569463961990783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.246 × 10⁹⁷(98-digit number)
92463181665288179028…61138927923981567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.849 × 10⁹⁸(99-digit number)
18492636333057635805…22277855847963135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.698 × 10⁹⁸(99-digit number)
36985272666115271611…44555711695926271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.397 × 10⁹⁸(99-digit number)
73970545332230543222…89111423391852543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.479 × 10⁹⁹(100-digit number)
14794109066446108644…78222846783705087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.958 × 10⁹⁹(100-digit number)
29588218132892217289…56445693567410175999
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,783,877 XPM·at block #6,817,477 · 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