Block #486,262

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2014, 12:20:07 PM · Difficulty 10.6225 · 6,321,887 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d31f794e49b76e4302ee5a79f5c305fedf127d6153a2a18c00ea8769a643741a

Height

#486,262

Difficulty

10.622456

Transactions

2

Size

1.47 KB

Version

2

Bits

0a9f594c

Nonce

25,018

Timestamp

4/11/2014, 12:20:07 PM

Confirmations

6,321,887

Merkle Root

096459554a351d94006af29e04b4bbe8c58326075a20ea452ca4607110cf4418
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.748 × 10⁹⁹(100-digit number)
27489390111438520027…44223347185319045119
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.748 × 10⁹⁹(100-digit number)
27489390111438520027…44223347185319045119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.497 × 10⁹⁹(100-digit number)
54978780222877040054…88446694370638090239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.099 × 10¹⁰⁰(101-digit number)
10995756044575408010…76893388741276180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.199 × 10¹⁰⁰(101-digit number)
21991512089150816021…53786777482552360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.398 × 10¹⁰⁰(101-digit number)
43983024178301632043…07573554965104721919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.796 × 10¹⁰⁰(101-digit number)
87966048356603264086…15147109930209443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.759 × 10¹⁰¹(102-digit number)
17593209671320652817…30294219860418887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.518 × 10¹⁰¹(102-digit number)
35186419342641305634…60588439720837775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.037 × 10¹⁰¹(102-digit number)
70372838685282611269…21176879441675550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.407 × 10¹⁰²(103-digit number)
14074567737056522253…42353758883351101439
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,709,236 XPM·at block #6,808,148 · 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