Block #353,596

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 1:05:27 AM · Difficulty 10.3288 · 6,455,337 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f832ec72be8e22e7516241424220402efc93cc2b9ca2f88db79298feba12081b

Height

#353,596

Difficulty

10.328764

Transactions

21

Size

7.34 KB

Version

2

Bits

0a5429d9

Nonce

71,754

Timestamp

1/11/2014, 1:05:27 AM

Confirmations

6,455,337

Merkle Root

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

9.015 × 10¹⁰⁴(105-digit number)
90159310415747435695…47417171136731760639
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
9.015 × 10¹⁰⁴(105-digit number)
90159310415747435695…47417171136731760639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.803 × 10¹⁰⁵(106-digit number)
18031862083149487139…94834342273463521279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.606 × 10¹⁰⁵(106-digit number)
36063724166298974278…89668684546927042559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.212 × 10¹⁰⁵(106-digit number)
72127448332597948556…79337369093854085119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.442 × 10¹⁰⁶(107-digit number)
14425489666519589711…58674738187708170239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.885 × 10¹⁰⁶(107-digit number)
28850979333039179422…17349476375416340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.770 × 10¹⁰⁶(107-digit number)
57701958666078358845…34698952750832680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.154 × 10¹⁰⁷(108-digit number)
11540391733215671769…69397905501665361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.308 × 10¹⁰⁷(108-digit number)
23080783466431343538…38795811003330723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.616 × 10¹⁰⁷(108-digit number)
46161566932862687076…77591622006661447679
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,715,520 XPM·at block #6,808,932 · 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