Block #344,555

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 9:19:11 AM · Difficulty 10.1962 · 6,464,114 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
59787f5b20469e6a1d368ea9c18ad4f07dfd1d6ee6bd8228708a5e553b09f367

Height

#344,555

Difficulty

10.196221

Transactions

6

Size

1.59 KB

Version

2

Bits

0a323b8d

Nonce

11,096

Timestamp

1/5/2014, 9:19:11 AM

Confirmations

6,464,114

Merkle Root

ac1fd131cc3fc1dea4bd96c58fc844e8162e462625946366b97a51e1c5f8dde7
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.925 × 10¹⁰⁴(105-digit number)
29251678847232486770…87173752181539426399
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.925 × 10¹⁰⁴(105-digit number)
29251678847232486770…87173752181539426399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.850 × 10¹⁰⁴(105-digit number)
58503357694464973541…74347504363078852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.170 × 10¹⁰⁵(106-digit number)
11700671538892994708…48695008726157705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.340 × 10¹⁰⁵(106-digit number)
23401343077785989416…97390017452315411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.680 × 10¹⁰⁵(106-digit number)
46802686155571978832…94780034904630822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.360 × 10¹⁰⁵(106-digit number)
93605372311143957665…89560069809261644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.872 × 10¹⁰⁶(107-digit number)
18721074462228791533…79120139618523289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.744 × 10¹⁰⁶(107-digit number)
37442148924457583066…58240279237046579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.488 × 10¹⁰⁶(107-digit number)
74884297848915166132…16480558474093158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.497 × 10¹⁰⁷(108-digit number)
14976859569783033226…32961116948186316799
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,713,397 XPM·at block #6,808,668 · 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