Block #389,458

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/4/2014, 12:27:43 PM · Difficulty 10.4183 · 6,421,038 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
69b3d4975a08cf3f81e6a590db5dab59158ab4238e32461361b6fa3dc68f5c06

Height

#389,458

Difficulty

10.418339

Transactions

8

Size

2.65 KB

Version

2

Bits

0a6b184b

Nonce

234,882,439

Timestamp

2/4/2014, 12:27:43 PM

Confirmations

6,421,038

Merkle Root

0bcfc565ad5f3f7985291bd39b7559f9b8f9e7e641aca707e2226f21ebf7136f
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.

8.500 × 10⁹³(94-digit number)
85006552678590221862…99543244173372999999
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
8.500 × 10⁹³(94-digit number)
85006552678590221862…99543244173372999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.700 × 10⁹⁴(95-digit number)
17001310535718044372…99086488346745999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.400 × 10⁹⁴(95-digit number)
34002621071436088745…98172976693491999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.800 × 10⁹⁴(95-digit number)
68005242142872177490…96345953386983999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.360 × 10⁹⁵(96-digit number)
13601048428574435498…92691906773967999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.720 × 10⁹⁵(96-digit number)
27202096857148870996…85383813547935999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.440 × 10⁹⁵(96-digit number)
54404193714297741992…70767627095871999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.088 × 10⁹⁶(97-digit number)
10880838742859548398…41535254191743999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.176 × 10⁹⁶(97-digit number)
21761677485719096796…83070508383487999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.352 × 10⁹⁶(97-digit number)
43523354971438193593…66141016766975999999
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,728,050 XPM·at block #6,810,495 · 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