Block #350,573

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 3:48:10 AM · Difficulty 10.2859 · 6,462,003 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d9ea88f90e05338bdc6aed4d15cc04c7351581557309251edd1587dbfbe01351

Height

#350,573

Difficulty

10.285895

Transactions

3

Size

653 B

Version

2

Bits

0a493064

Nonce

50,212

Timestamp

1/9/2014, 3:48:10 AM

Confirmations

6,462,003

Merkle Root

20e48b0ec66e82386d82869a5d959c1df3dfc3236a73046804c7ed5fa8848688
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.

3.949 × 10¹⁰⁰(101-digit number)
39499960537507159935…43951990329802175999
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
3.949 × 10¹⁰⁰(101-digit number)
39499960537507159935…43951990329802175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.899 × 10¹⁰⁰(101-digit number)
78999921075014319870…87903980659604351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.579 × 10¹⁰¹(102-digit number)
15799984215002863974…75807961319208703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.159 × 10¹⁰¹(102-digit number)
31599968430005727948…51615922638417407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.319 × 10¹⁰¹(102-digit number)
63199936860011455896…03231845276834815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.263 × 10¹⁰²(103-digit number)
12639987372002291179…06463690553669631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.527 × 10¹⁰²(103-digit number)
25279974744004582358…12927381107339263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.055 × 10¹⁰²(103-digit number)
50559949488009164717…25854762214678527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.011 × 10¹⁰³(104-digit number)
10111989897601832943…51709524429357055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.022 × 10¹⁰³(104-digit number)
20223979795203665886…03419048858714111999
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,744,642 XPM·at block #6,812,575 · 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