Block #354,111

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 8:51:40 AM · Difficulty 10.3352 · 6,459,973 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a431c43e2382995228d1d6ced1261be10b5fe284beea546fc37db513e8469d8

Height

#354,111

Difficulty

10.335207

Transactions

20

Size

10.02 KB

Version

2

Bits

0a55d019

Nonce

8,559

Timestamp

1/11/2014, 8:51:40 AM

Confirmations

6,459,973

Merkle Root

62cfef4235302734afaabdcf5acdcc155933afc4e378f30cca1d44d698e0abf4
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.298 × 10¹⁰¹(102-digit number)
12988571490582892047…62629230459602569599
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.298 × 10¹⁰¹(102-digit number)
12988571490582892047…62629230459602569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.597 × 10¹⁰¹(102-digit number)
25977142981165784094…25258460919205139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.195 × 10¹⁰¹(102-digit number)
51954285962331568189…50516921838410278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.039 × 10¹⁰²(103-digit number)
10390857192466313637…01033843676820556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.078 × 10¹⁰²(103-digit number)
20781714384932627275…02067687353641113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.156 × 10¹⁰²(103-digit number)
41563428769865254551…04135374707282227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.312 × 10¹⁰²(103-digit number)
83126857539730509103…08270749414564454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.662 × 10¹⁰³(104-digit number)
16625371507946101820…16541498829128908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.325 × 10¹⁰³(104-digit number)
33250743015892203641…33082997658257817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.650 × 10¹⁰³(104-digit number)
66501486031784407282…66165995316515635199
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,756,753 XPM·at block #6,814,083 · 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.
Privacy Policy·

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