Block #347,809

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 10:49:06 AM · Difficulty 10.2408 · 6,461,438 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba8ce8348a8e50098df3d8708bf35bd1dc81227ac0210f7c6aa144f2808052b2

Height

#347,809

Difficulty

10.240848

Transactions

5

Size

1.37 KB

Version

2

Bits

0a3da831

Nonce

610

Timestamp

1/7/2014, 10:49:06 AM

Confirmations

6,461,438

Merkle Root

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

1.426 × 10¹⁰⁰(101-digit number)
14262813929878195741…91648775529338982399
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
1.426 × 10¹⁰⁰(101-digit number)
14262813929878195741…91648775529338982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.852 × 10¹⁰⁰(101-digit number)
28525627859756391482…83297551058677964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.705 × 10¹⁰⁰(101-digit number)
57051255719512782965…66595102117355929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.141 × 10¹⁰¹(102-digit number)
11410251143902556593…33190204234711859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.282 × 10¹⁰¹(102-digit number)
22820502287805113186…66380408469423718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.564 × 10¹⁰¹(102-digit number)
45641004575610226372…32760816938847436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.128 × 10¹⁰¹(102-digit number)
91282009151220452744…65521633877694873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.825 × 10¹⁰²(103-digit number)
18256401830244090548…31043267755389747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.651 × 10¹⁰²(103-digit number)
36512803660488181097…62086535510779494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.302 × 10¹⁰²(103-digit number)
73025607320976362195…24173071021558988799
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,718,041 XPM·at block #6,809,246 · 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