Block #375,744

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 10:29:13 PM · Difficulty 10.4238 · 6,442,074 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
67e14d7f850d3f0c904ca4a5ac106b793e0ff8a65495a95d0d427126485710f1

Height

#375,744

Difficulty

10.423780

Transactions

7

Size

3.85 KB

Version

2

Bits

0a6c7cd1

Nonce

2,000

Timestamp

1/25/2014, 10:29:13 PM

Confirmations

6,442,074

Merkle Root

2ddd68352e43f37ef70d36bf0eef5439156b4c76350c4adbf54682e96b318aed
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.096 × 10⁹⁹(100-digit number)
10968190854572476856…84195366106782317999
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.096 × 10⁹⁹(100-digit number)
10968190854572476856…84195366106782317999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.193 × 10⁹⁹(100-digit number)
21936381709144953713…68390732213564635999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.387 × 10⁹⁹(100-digit number)
43872763418289907427…36781464427129271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.774 × 10⁹⁹(100-digit number)
87745526836579814854…73562928854258543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.754 × 10¹⁰⁰(101-digit number)
17549105367315962970…47125857708517087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.509 × 10¹⁰⁰(101-digit number)
35098210734631925941…94251715417034175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.019 × 10¹⁰⁰(101-digit number)
70196421469263851883…88503430834068351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.403 × 10¹⁰¹(102-digit number)
14039284293852770376…77006861668136703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.807 × 10¹⁰¹(102-digit number)
28078568587705540753…54013723336273407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.615 × 10¹⁰¹(102-digit number)
56157137175411081506…08027446672546815999
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,786,607 XPM·at block #6,817,817 · 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