Block #339,901

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2014, 10:29:55 AM · Difficulty 10.1276 · 6,466,382 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7c11a6b72e325fa7be6bd764e64e7492a37e81146328a6cd792b4d9dd960fea0

Height

#339,901

Difficulty

10.127586

Transactions

4

Size

993 B

Version

2

Bits

0a20a97e

Nonce

45,112

Timestamp

1/2/2014, 10:29:55 AM

Confirmations

6,466,382

Merkle Root

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

2.329 × 10⁹⁹(100-digit number)
23295606214577108244…93159389128865106399
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
2.329 × 10⁹⁹(100-digit number)
23295606214577108244…93159389128865106399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.659 × 10⁹⁹(100-digit number)
46591212429154216489…86318778257730212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.318 × 10⁹⁹(100-digit number)
93182424858308432979…72637556515460425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.863 × 10¹⁰⁰(101-digit number)
18636484971661686595…45275113030920851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.727 × 10¹⁰⁰(101-digit number)
37272969943323373191…90550226061841702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.454 × 10¹⁰⁰(101-digit number)
74545939886646746383…81100452123683404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.490 × 10¹⁰¹(102-digit number)
14909187977329349276…62200904247366809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.981 × 10¹⁰¹(102-digit number)
29818375954658698553…24401808494733619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.963 × 10¹⁰¹(102-digit number)
59636751909317397106…48803616989467238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.192 × 10¹⁰²(103-digit number)
11927350381863479421…97607233978934476799
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,694,350 XPM·at block #6,806,282 · 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