Block #341,549

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 12:44:18 PM · Difficulty 10.1406 · 6,496,552 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eeb4caa85a6878c2b6a957c34bfd9177d4018d4c6b2c4ebe588174e80de9d758

Height

#341,549

Difficulty

10.140581

Transactions

17

Size

17.32 KB

Version

2

Bits

0a23fd1c

Nonce

182,603

Timestamp

1/3/2014, 12:44:18 PM

Confirmations

6,496,552

Merkle Root

281e1e7d63cbd33f1f02db2de756c0fb00c56b7e29cfebff80a37f107431e99f
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.878 × 10⁹⁹(100-digit number)
88786753542001782164…93709570712094619799
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.878 × 10⁹⁹(100-digit number)
88786753542001782164…93709570712094619799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.775 × 10¹⁰⁰(101-digit number)
17757350708400356432…87419141424189239599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.551 × 10¹⁰⁰(101-digit number)
35514701416800712865…74838282848378479199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.102 × 10¹⁰⁰(101-digit number)
71029402833601425731…49676565696756958399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.420 × 10¹⁰¹(102-digit number)
14205880566720285146…99353131393513916799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.841 × 10¹⁰¹(102-digit number)
28411761133440570292…98706262787027833599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.682 × 10¹⁰¹(102-digit number)
56823522266881140585…97412525574055667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.136 × 10¹⁰²(103-digit number)
11364704453376228117…94825051148111334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.272 × 10¹⁰²(103-digit number)
22729408906752456234…89650102296222668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.545 × 10¹⁰²(103-digit number)
45458817813504912468…79300204592445337599
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,949,161 XPM·at block #6,838,100 · 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