Block #396,053

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/9/2014, 3:58:04 AM · Difficulty 10.4097 · 6,413,506 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ea14197ccda2d794fb2573ba16ee075f5b368dcfd428530c3d628b81e53497bd

Height

#396,053

Difficulty

10.409700

Transactions

3

Size

9.37 KB

Version

2

Bits

0a68e221

Nonce

108,047

Timestamp

2/9/2014, 3:58:04 AM

Confirmations

6,413,506

Merkle Root

edc319ffa1e7f68ea185790f1a9e2b0280770fa5a48d16619d298b9b2da86cd0
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.754 × 10⁹⁹(100-digit number)
67543658597538396864…03348263862657586879
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.754 × 10⁹⁹(100-digit number)
67543658597538396864…03348263862657586879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.350 × 10¹⁰⁰(101-digit number)
13508731719507679372…06696527725315173759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.701 × 10¹⁰⁰(101-digit number)
27017463439015358745…13393055450630347519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.403 × 10¹⁰⁰(101-digit number)
54034926878030717491…26786110901260695039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.080 × 10¹⁰¹(102-digit number)
10806985375606143498…53572221802521390079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.161 × 10¹⁰¹(102-digit number)
21613970751212286996…07144443605042780159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.322 × 10¹⁰¹(102-digit number)
43227941502424573993…14288887210085560319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.645 × 10¹⁰¹(102-digit number)
86455883004849147986…28577774420171120639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.729 × 10¹⁰²(103-digit number)
17291176600969829597…57155548840342241279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.458 × 10¹⁰²(103-digit number)
34582353201939659194…14311097680684482559
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,720,547 XPM·at block #6,809,558 · 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