Block #345,436

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 10:32:13 PM · Difficulty 10.2103 · 6,479,083 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3dfe93dea46eb5bce2f31b5911a782f9a1aca66f110f431199c37e9712cee3a5

Height

#345,436

Difficulty

10.210287

Transactions

4

Size

2.25 KB

Version

2

Bits

0a35d563

Nonce

2,200

Timestamp

1/5/2014, 10:32:13 PM

Confirmations

6,479,083

Merkle Root

26ef8fbddc5edde101ec4a2ebac0d0125e93a65ed386e8278de072806bd64a19
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.890 × 10⁹⁷(98-digit number)
28903590662516998167…30393416970764526199
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.890 × 10⁹⁷(98-digit number)
28903590662516998167…30393416970764526199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.780 × 10⁹⁷(98-digit number)
57807181325033996335…60786833941529052399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.156 × 10⁹⁸(99-digit number)
11561436265006799267…21573667883058104799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.312 × 10⁹⁸(99-digit number)
23122872530013598534…43147335766116209599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.624 × 10⁹⁸(99-digit number)
46245745060027197068…86294671532232419199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.249 × 10⁹⁸(99-digit number)
92491490120054394137…72589343064464838399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.849 × 10⁹⁹(100-digit number)
18498298024010878827…45178686128929676799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.699 × 10⁹⁹(100-digit number)
36996596048021757654…90357372257859353599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.399 × 10⁹⁹(100-digit number)
73993192096043515309…80714744515718707199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.479 × 10¹⁰⁰(101-digit number)
14798638419208703061…61429489031437414399
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,840,215 XPM·at block #6,824,518 · 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