Block #389,026

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/4/2014, 5:59:59 AM · Difficulty 10.4137 · 6,419,911 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7be01b6a517fea19bb26a7ba222a6713e0c65d1f9d1b9d4b9e18b1737c464798

Height

#389,026

Difficulty

10.413673

Transactions

9

Size

5.46 KB

Version

2

Bits

0a69e67c

Nonce

36,095

Timestamp

2/4/2014, 5:59:59 AM

Confirmations

6,419,911

Merkle Root

7a577e9097cac2b9d84ea41d7d986d466624c58088940f2d8022b4bc48d8f5ae
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.026 × 10¹⁰⁴(105-digit number)
10263371251897133445…98605700486876330879
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.026 × 10¹⁰⁴(105-digit number)
10263371251897133445…98605700486876330879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.052 × 10¹⁰⁴(105-digit number)
20526742503794266891…97211400973752661759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.105 × 10¹⁰⁴(105-digit number)
41053485007588533783…94422801947505323519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.210 × 10¹⁰⁴(105-digit number)
82106970015177067567…88845603895010647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.642 × 10¹⁰⁵(106-digit number)
16421394003035413513…77691207790021294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.284 × 10¹⁰⁵(106-digit number)
32842788006070827027…55382415580042588159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.568 × 10¹⁰⁵(106-digit number)
65685576012141654054…10764831160085176319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.313 × 10¹⁰⁶(107-digit number)
13137115202428330810…21529662320170352639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.627 × 10¹⁰⁶(107-digit number)
26274230404856661621…43059324640340705279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.254 × 10¹⁰⁶(107-digit number)
52548460809713323243…86118649280681410559
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,715,553 XPM·at block #6,808,936 · 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