Block #348,017

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 1:31:26 PM · Difficulty 10.2476 · 6,460,981 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eed958448440a6a9e19ed5ecbf51639bf7bf5adae7d77c525eafb60236bf8b7c

Height

#348,017

Difficulty

10.247636

Transactions

5

Size

1.15 KB

Version

2

Bits

0a3f6517

Nonce

46,728

Timestamp

1/7/2014, 1:31:26 PM

Confirmations

6,460,981

Merkle Root

737c757d3ff436276953d89ad6132ada862a996a9c75561eddc3fd4d144a1da6
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.285 × 10¹⁰⁶(107-digit number)
22853483250179543362…78270896858141639679
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.285 × 10¹⁰⁶(107-digit number)
22853483250179543362…78270896858141639679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.570 × 10¹⁰⁶(107-digit number)
45706966500359086724…56541793716283279359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.141 × 10¹⁰⁶(107-digit number)
91413933000718173448…13083587432566558719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.828 × 10¹⁰⁷(108-digit number)
18282786600143634689…26167174865133117439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.656 × 10¹⁰⁷(108-digit number)
36565573200287269379…52334349730266234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.313 × 10¹⁰⁷(108-digit number)
73131146400574538758…04668699460532469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.462 × 10¹⁰⁸(109-digit number)
14626229280114907751…09337398921064939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.925 × 10¹⁰⁸(109-digit number)
29252458560229815503…18674797842129879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.850 × 10¹⁰⁸(109-digit number)
58504917120459631007…37349595684259758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.170 × 10¹⁰⁹(110-digit number)
11700983424091926201…74699191368519516159
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,716,043 XPM·at block #6,808,997 · 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