Block #351,203

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 1:17:26 PM · Difficulty 10.2946 · 6,455,175 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3762a033e097901d60997187a55e1949f79eb0c10091de2ce30048cc9bfa247e

Height

#351,203

Difficulty

10.294646

Transactions

12

Size

4.12 KB

Version

2

Bits

0a4b6ded

Nonce

33,812

Timestamp

1/9/2014, 1:17:26 PM

Confirmations

6,455,175

Merkle Root

6c84f9d415a9ab799e39cf9a8812963c9cc98fa3cd72570a4f1c0cffd2c16eac
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.029 × 10¹⁰⁴(105-digit number)
10299215767730740302…44435011149178035199
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.029 × 10¹⁰⁴(105-digit number)
10299215767730740302…44435011149178035199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.059 × 10¹⁰⁴(105-digit number)
20598431535461480605…88870022298356070399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.119 × 10¹⁰⁴(105-digit number)
41196863070922961210…77740044596712140799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.239 × 10¹⁰⁴(105-digit number)
82393726141845922421…55480089193424281599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.647 × 10¹⁰⁵(106-digit number)
16478745228369184484…10960178386848563199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.295 × 10¹⁰⁵(106-digit number)
32957490456738368968…21920356773697126399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.591 × 10¹⁰⁵(106-digit number)
65914980913476737936…43840713547394252799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.318 × 10¹⁰⁶(107-digit number)
13182996182695347587…87681427094788505599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.636 × 10¹⁰⁶(107-digit number)
26365992365390695174…75362854189577011199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.273 × 10¹⁰⁶(107-digit number)
52731984730781390349…50725708379154022399
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,695,113 XPM·at block #6,806,377 · 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