Block #471,162

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/2/2014, 10:07:11 AM · Difficulty 10.4314 · 6,371,836 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2b3bbcc3bccc3f9d247fc5819a9778598efeba1a477e8f7c1d5efc6cdfa3d9b4

Height

#471,162

Difficulty

10.431410

Transactions

1

Size

937 B

Version

2

Bits

0a6e70e5

Nonce

19,465

Timestamp

4/2/2014, 10:07:11 AM

Confirmations

6,371,836

Merkle Root

16e2ca2898f055f0f1ddecb727898a67fbf7181cc2aae220775ecbb53e6d154c
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.151 × 10⁹⁹(100-digit number)
11511312533999267226…19396866034593115559
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.151 × 10⁹⁹(100-digit number)
11511312533999267226…19396866034593115559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.302 × 10⁹⁹(100-digit number)
23022625067998534453…38793732069186231119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.604 × 10⁹⁹(100-digit number)
46045250135997068907…77587464138372462239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.209 × 10⁹⁹(100-digit number)
92090500271994137814…55174928276744924479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.841 × 10¹⁰⁰(101-digit number)
18418100054398827562…10349856553489848959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.683 × 10¹⁰⁰(101-digit number)
36836200108797655125…20699713106979697919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.367 × 10¹⁰⁰(101-digit number)
73672400217595310251…41399426213959395839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.473 × 10¹⁰¹(102-digit number)
14734480043519062050…82798852427918791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.946 × 10¹⁰¹(102-digit number)
29468960087038124100…65597704855837583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.893 × 10¹⁰¹(102-digit number)
58937920174076248201…31195409711675166719
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,988,339 XPM·at block #6,842,997 · 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