Block #389,283

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/4/2014, 9:34:43 AM · Difficulty 10.4185 · 6,419,477 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
53b9588ab95684df27b740811548eb0db18147f121013004a3aa6f2a77f30a94

Height

#389,283

Difficulty

10.418502

Transactions

4

Size

884 B

Version

2

Bits

0a6b22f5

Nonce

3,890

Timestamp

2/4/2014, 9:34:43 AM

Confirmations

6,419,477

Merkle Root

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

7.930 × 10⁹⁹(100-digit number)
79309342901958603414…85858747301014568959
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
7.930 × 10⁹⁹(100-digit number)
79309342901958603414…85858747301014568959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.586 × 10¹⁰⁰(101-digit number)
15861868580391720682…71717494602029137919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.172 × 10¹⁰⁰(101-digit number)
31723737160783441365…43434989204058275839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.344 × 10¹⁰⁰(101-digit number)
63447474321566882731…86869978408116551679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.268 × 10¹⁰¹(102-digit number)
12689494864313376546…73739956816233103359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.537 × 10¹⁰¹(102-digit number)
25378989728626753092…47479913632466206719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.075 × 10¹⁰¹(102-digit number)
50757979457253506185…94959827264932413439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.015 × 10¹⁰²(103-digit number)
10151595891450701237…89919654529864826879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.030 × 10¹⁰²(103-digit number)
20303191782901402474…79839309059729653759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.060 × 10¹⁰²(103-digit number)
40606383565802804948…59678618119459307519
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,714,127 XPM·at block #6,808,759 · 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