Block #341,450

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 11:21:10 AM · Difficulty 10.1378 · 6,473,018 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f232f8fe73667b3badda9775486396b663f4eb6412961d79f11d388c4c797a2e

Height

#341,450

Difficulty

10.137760

Transactions

9

Size

4.47 KB

Version

2

Bits

0a234443

Nonce

12,664

Timestamp

1/3/2014, 11:21:10 AM

Confirmations

6,473,018

Merkle Root

c66ad359a842654fc4a60fe6ba1b572889173886f73405036c658b064d866a74
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.965 × 10¹⁰⁴(105-digit number)
29655765964144917545…21581435037023667199
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.965 × 10¹⁰⁴(105-digit number)
29655765964144917545…21581435037023667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.931 × 10¹⁰⁴(105-digit number)
59311531928289835091…43162870074047334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.186 × 10¹⁰⁵(106-digit number)
11862306385657967018…86325740148094668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.372 × 10¹⁰⁵(106-digit number)
23724612771315934036…72651480296189337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.744 × 10¹⁰⁵(106-digit number)
47449225542631868073…45302960592378675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.489 × 10¹⁰⁵(106-digit number)
94898451085263736146…90605921184757350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.897 × 10¹⁰⁶(107-digit number)
18979690217052747229…81211842369514700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.795 × 10¹⁰⁶(107-digit number)
37959380434105494458…62423684739029401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.591 × 10¹⁰⁶(107-digit number)
75918760868210988916…24847369478058803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.518 × 10¹⁰⁷(108-digit number)
15183752173642197783…49694738956117606399
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,759,817 XPM·at block #6,814,467 · 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