Block #438,753

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/11/2014, 5:46:00 AM · Difficulty 10.3558 · 6,379,183 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
270897c8beb89c3b068f4141823f9c6757190f7c7773ca0d75d0d5a56e48a72d

Height

#438,753

Difficulty

10.355778

Transactions

7

Size

1.90 KB

Version

2

Bits

0a5b1448

Nonce

180,768

Timestamp

3/11/2014, 5:46:00 AM

Confirmations

6,379,183

Merkle Root

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

6.338 × 10⁹⁸(99-digit number)
63389188457772394117…01649826704145988039
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
6.338 × 10⁹⁸(99-digit number)
63389188457772394117…01649826704145988039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.267 × 10⁹⁹(100-digit number)
12677837691554478823…03299653408291976079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.535 × 10⁹⁹(100-digit number)
25355675383108957646…06599306816583952159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.071 × 10⁹⁹(100-digit number)
50711350766217915293…13198613633167904319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.014 × 10¹⁰⁰(101-digit number)
10142270153243583058…26397227266335808639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.028 × 10¹⁰⁰(101-digit number)
20284540306487166117…52794454532671617279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.056 × 10¹⁰⁰(101-digit number)
40569080612974332235…05588909065343234559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.113 × 10¹⁰⁰(101-digit number)
81138161225948664470…11177818130686469119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.622 × 10¹⁰¹(102-digit number)
16227632245189732894…22355636261372938239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.245 × 10¹⁰¹(102-digit number)
32455264490379465788…44711272522745876479
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,787,553 XPM·at block #6,817,935 · 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.
Privacy Policy·

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