Block #390,038

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/4/2014, 9:28:12 PM · Difficulty 10.4233 · 6,421,053 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f9a6a943bc68c781002f7d9997dfdb0ab52f8f0ec91147df3ceca821b3d72878

Height

#390,038

Difficulty

10.423274

Transactions

5

Size

1.23 KB

Version

2

Bits

0a6c5bae

Nonce

101,491

Timestamp

2/4/2014, 9:28:12 PM

Confirmations

6,421,053

Merkle Root

67783ec791b1532cd602b203b5f8c9395cff152834e9f4ccd7a7f17b6a9197a7
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.980 × 10¹⁰³(104-digit number)
29805905024304208143…26980291790953449149
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.980 × 10¹⁰³(104-digit number)
29805905024304208143…26980291790953449149
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.961 × 10¹⁰³(104-digit number)
59611810048608416286…53960583581906898299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.192 × 10¹⁰⁴(105-digit number)
11922362009721683257…07921167163813796599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.384 × 10¹⁰⁴(105-digit number)
23844724019443366514…15842334327627593199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.768 × 10¹⁰⁴(105-digit number)
47689448038886733029…31684668655255186399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.537 × 10¹⁰⁴(105-digit number)
95378896077773466058…63369337310510372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.907 × 10¹⁰⁵(106-digit number)
19075779215554693211…26738674621020745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.815 × 10¹⁰⁵(106-digit number)
38151558431109386423…53477349242041491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.630 × 10¹⁰⁵(106-digit number)
76303116862218772846…06954698484082982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.526 × 10¹⁰⁶(107-digit number)
15260623372443754569…13909396968165964799
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,732,835 XPM·at block #6,811,090 · 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