Block #341,312

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 9:12:55 AM · Difficulty 10.1362 · 6,468,506 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6eefa55f45be958ca1b12108542eeb7fe7d3f1118aadf740efa4e7ee96ff9d0f

Height

#341,312

Difficulty

10.136177

Transactions

12

Size

21.46 KB

Version

2

Bits

0a22dc87

Nonce

168,057

Timestamp

1/3/2014, 9:12:55 AM

Confirmations

6,468,506

Merkle Root

fd8abfb094e52f73be792740f694a014f3b45c299750da5281d0f3431b5e4e60
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.123 × 10⁹⁸(99-digit number)
51233723011307798099…51685778265399421999
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.123 × 10⁹⁸(99-digit number)
51233723011307798099…51685778265399421999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.024 × 10⁹⁹(100-digit number)
10246744602261559619…03371556530798843999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.049 × 10⁹⁹(100-digit number)
20493489204523119239…06743113061597687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.098 × 10⁹⁹(100-digit number)
40986978409046238479…13486226123195375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.197 × 10⁹⁹(100-digit number)
81973956818092476959…26972452246390751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.639 × 10¹⁰⁰(101-digit number)
16394791363618495391…53944904492781503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.278 × 10¹⁰⁰(101-digit number)
32789582727236990783…07889808985563007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.557 × 10¹⁰⁰(101-digit number)
65579165454473981567…15779617971126015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.311 × 10¹⁰¹(102-digit number)
13115833090894796313…31559235942252031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.623 × 10¹⁰¹(102-digit number)
26231666181789592627…63118471884504063999
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,722,628 XPM·at block #6,809,817 · 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