Block #462,179

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/27/2014, 6:59:47 AM · Difficulty 10.4084 · 6,348,718 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec87566f54f7c5f704ba88b56ff0087177cef2e78416da08b06fd26d89e32da3

Height

#462,179

Difficulty

10.408444

Transactions

2

Size

1.17 KB

Version

2

Bits

0a688fcf

Nonce

5,300

Timestamp

3/27/2014, 6:59:47 AM

Confirmations

6,348,718

Merkle Root

7c8082dfb6efb18e727e35ccad9c1e7b60157eefb4c617c652ec1ac756bbebbe
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.002 × 10⁹⁹(100-digit number)
20029103784151501284…65987617820065503119
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.002 × 10⁹⁹(100-digit number)
20029103784151501284…65987617820065503119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.005 × 10⁹⁹(100-digit number)
40058207568303002568…31975235640131006239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.011 × 10⁹⁹(100-digit number)
80116415136606005137…63950471280262012479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.602 × 10¹⁰⁰(101-digit number)
16023283027321201027…27900942560524024959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.204 × 10¹⁰⁰(101-digit number)
32046566054642402054…55801885121048049919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.409 × 10¹⁰⁰(101-digit number)
64093132109284804109…11603770242096099839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.281 × 10¹⁰¹(102-digit number)
12818626421856960821…23207540484192199679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.563 × 10¹⁰¹(102-digit number)
25637252843713921643…46415080968384399359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.127 × 10¹⁰¹(102-digit number)
51274505687427843287…92830161936768798719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.025 × 10¹⁰²(103-digit number)
10254901137485568657…85660323873537597439
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,731,274 XPM·at block #6,810,896 · 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