Block #466,855

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/30/2014, 10:18:39 AM · Difficulty 10.4288 · 6,359,220 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
185788aebc780f73f1a4e60450cd0801203cadd79136e4a33951eaf14e03a030

Height

#466,855

Difficulty

10.428781

Transactions

14

Size

3.86 KB

Version

2

Bits

0a6dc497

Nonce

104,613

Timestamp

3/30/2014, 10:18:39 AM

Confirmations

6,359,220

Merkle Root

e73c93b5c5c4f9e78ad8bf17a4098bcc76d766fa186af8f68f985e61343ef30a
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.

9.038 × 10⁹⁸(99-digit number)
90386322017796633129…10907036961486371841
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
9.038 × 10⁹⁸(99-digit number)
90386322017796633129…10907036961486371841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.807 × 10⁹⁹(100-digit number)
18077264403559326625…21814073922972743681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.615 × 10⁹⁹(100-digit number)
36154528807118653251…43628147845945487361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.230 × 10⁹⁹(100-digit number)
72309057614237306503…87256295691890974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.446 × 10¹⁰⁰(101-digit number)
14461811522847461300…74512591383781949441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.892 × 10¹⁰⁰(101-digit number)
28923623045694922601…49025182767563898881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.784 × 10¹⁰⁰(101-digit number)
57847246091389845202…98050365535127797761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.156 × 10¹⁰¹(102-digit number)
11569449218277969040…96100731070255595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.313 × 10¹⁰¹(102-digit number)
23138898436555938081…92201462140511191041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.627 × 10¹⁰¹(102-digit number)
46277796873111876162…84402924281022382081
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,852,720 XPM·at block #6,826,074 · 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