Block #388,417

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/3/2014, 6:58:08 PM · Difficulty 10.4188 · 6,420,931 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6ed84c6da2e0331d589bdc553f94ed836777b449ca61dec69706261a7842ce5c

Height

#388,417

Difficulty

10.418755

Transactions

7

Size

1.88 KB

Version

2

Bits

0a6b338f

Nonce

64,962

Timestamp

2/3/2014, 6:58:08 PM

Confirmations

6,420,931

Merkle Root

f037821d986ec2061646f321b82fea5464a3091840f7423851b9764f4eeebf94
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.022 × 10⁹⁹(100-digit number)
10224518539633821079…12366802084798640479
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.022 × 10⁹⁹(100-digit number)
10224518539633821079…12366802084798640479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.044 × 10⁹⁹(100-digit number)
20449037079267642159…24733604169597280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.089 × 10⁹⁹(100-digit number)
40898074158535284319…49467208339194561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.179 × 10⁹⁹(100-digit number)
81796148317070568639…98934416678389123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.635 × 10¹⁰⁰(101-digit number)
16359229663414113727…97868833356778247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.271 × 10¹⁰⁰(101-digit number)
32718459326828227455…95737666713556495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.543 × 10¹⁰⁰(101-digit number)
65436918653656454911…91475333427112990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.308 × 10¹⁰¹(102-digit number)
13087383730731290982…82950666854225981439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.617 × 10¹⁰¹(102-digit number)
26174767461462581964…65901333708451962879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.234 × 10¹⁰¹(102-digit number)
52349534922925163929…31802667416903925759
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,718,850 XPM·at block #6,809,347 · 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