Block #340,918

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 3:01:29 AM · Difficulty 10.1327 · 6,475,892 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e7cb4657337a3e3523096e474729d9967461ae1c48f470240bb13dbc7eac129a

Height

#340,918

Difficulty

10.132701

Transactions

7

Size

12.94 KB

Version

2

Bits

0a21f8b1

Nonce

453,364

Timestamp

1/3/2014, 3:01:29 AM

Confirmations

6,475,892

Merkle Root

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

6.305 × 10¹⁰⁰(101-digit number)
63055975520123940825…39282878645179267999
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
6.305 × 10¹⁰⁰(101-digit number)
63055975520123940825…39282878645179267999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.261 × 10¹⁰¹(102-digit number)
12611195104024788165…78565757290358535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.522 × 10¹⁰¹(102-digit number)
25222390208049576330…57131514580717071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.044 × 10¹⁰¹(102-digit number)
50444780416099152660…14263029161434143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.008 × 10¹⁰²(103-digit number)
10088956083219830532…28526058322868287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.017 × 10¹⁰²(103-digit number)
20177912166439661064…57052116645736575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.035 × 10¹⁰²(103-digit number)
40355824332879322128…14104233291473151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.071 × 10¹⁰²(103-digit number)
80711648665758644256…28208466582946303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.614 × 10¹⁰³(104-digit number)
16142329733151728851…56416933165892607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.228 × 10¹⁰³(104-digit number)
32284659466303457702…12833866331785215999
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,778,517 XPM·at block #6,816,809 · 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