Block #350,348

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2014, 11:48:36 PM · Difficulty 10.2878 · 6,458,568 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5108e2f5fcbf5cd3cec48ce4b7b70df73404f39c6c98562faa7d5618dca34a9d

Height

#350,348

Difficulty

10.287825

Transactions

5

Size

1.37 KB

Version

2

Bits

0a49aee6

Nonce

39,372

Timestamp

1/8/2014, 11:48:36 PM

Confirmations

6,458,568

Merkle Root

3c18d9320676b37be1d3d1c327b821acb7b02570f9906828449b66e78a6936e8
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.

5.094 × 10¹⁰¹(102-digit number)
50948096678087357698…53758419593112911999
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
5.094 × 10¹⁰¹(102-digit number)
50948096678087357698…53758419593112911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.018 × 10¹⁰²(103-digit number)
10189619335617471539…07516839186225823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.037 × 10¹⁰²(103-digit number)
20379238671234943079…15033678372451647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.075 × 10¹⁰²(103-digit number)
40758477342469886158…30067356744903295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.151 × 10¹⁰²(103-digit number)
81516954684939772317…60134713489806591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.630 × 10¹⁰³(104-digit number)
16303390936987954463…20269426979613183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.260 × 10¹⁰³(104-digit number)
32606781873975908926…40538853959226367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.521 × 10¹⁰³(104-digit number)
65213563747951817853…81077707918452735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.304 × 10¹⁰⁴(105-digit number)
13042712749590363570…62155415836905471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.608 × 10¹⁰⁴(105-digit number)
26085425499180727141…24310831673810943999
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,383 XPM·at block #6,808,915 · 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