Block #338,006

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2014, 3:12:05 AM · Difficulty 10.1235 · 6,480,026 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2fffa43ac339cddacd811b883c022428aef322d5e851e01096071da4a1c969b8

Height

#338,006

Difficulty

10.123548

Transactions

6

Size

2.60 KB

Version

2

Bits

0a1fa0d3

Nonce

12,290

Timestamp

1/1/2014, 3:12:05 AM

Confirmations

6,480,026

Merkle Root

a86ee916fd43d783630cace4bb839ac674c91e91f1f6ac00bcfc9a805cd34cc2
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.

8.012 × 10¹⁰⁰(101-digit number)
80125057884087995605…39650791848279851519
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
8.012 × 10¹⁰⁰(101-digit number)
80125057884087995605…39650791848279851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.602 × 10¹⁰¹(102-digit number)
16025011576817599121…79301583696559703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.205 × 10¹⁰¹(102-digit number)
32050023153635198242…58603167393119406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.410 × 10¹⁰¹(102-digit number)
64100046307270396484…17206334786238812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.282 × 10¹⁰²(103-digit number)
12820009261454079296…34412669572477624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.564 × 10¹⁰²(103-digit number)
25640018522908158593…68825339144955248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.128 × 10¹⁰²(103-digit number)
51280037045816317187…37650678289910497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.025 × 10¹⁰³(104-digit number)
10256007409163263437…75301356579820994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.051 × 10¹⁰³(104-digit number)
20512014818326526875…50602713159641989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.102 × 10¹⁰³(104-digit number)
41024029636653053750…01205426319283978239
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,788,325 XPM·at block #6,818,031 · 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