Block #488,460

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/12/2014, 5:23:57 PM · Difficulty 10.6552 · 6,327,530 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c01b7a0a0221a51ab292b4b33001431c978ddef98381d8a21c5f004b7e90baef

Height

#488,460

Difficulty

10.655208

Transactions

6

Size

1.56 KB

Version

2

Bits

0aa7bbb3

Nonce

103,155,185

Timestamp

4/12/2014, 5:23:57 PM

Confirmations

6,327,530

Merkle Root

70f89dc090660d58f25307120ea921385712509378f1b3687f24b3f84e76ce04
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.

5.511 × 10⁹⁹(100-digit number)
55110243931554005144…76158009987204408319
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
5.511 × 10⁹⁹(100-digit number)
55110243931554005144…76158009987204408319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.102 × 10¹⁰⁰(101-digit number)
11022048786310801028…52316019974408816639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.204 × 10¹⁰⁰(101-digit number)
22044097572621602057…04632039948817633279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.408 × 10¹⁰⁰(101-digit number)
44088195145243204115…09264079897635266559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.817 × 10¹⁰⁰(101-digit number)
88176390290486408230…18528159795270533119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.763 × 10¹⁰¹(102-digit number)
17635278058097281646…37056319590541066239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.527 × 10¹⁰¹(102-digit number)
35270556116194563292…74112639181082132479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.054 × 10¹⁰¹(102-digit number)
70541112232389126584…48225278362164264959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.410 × 10¹⁰²(103-digit number)
14108222446477825316…96450556724328529919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.821 × 10¹⁰²(103-digit number)
28216444892955650633…92901113448657059839
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,772,034 XPM·at block #6,815,989 · 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