Block #325,395

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/23/2013, 12:19:11 AM · Difficulty 10.2047 · 6,485,709 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a6f8bb97ddfb86e5d18fdbfee3b64460286a4f73467ea2e071debe85f6deabb

Height

#325,395

Difficulty

10.204741

Transactions

4

Size

1.71 KB

Version

2

Bits

0a3469e6

Nonce

360,763

Timestamp

12/23/2013, 12:19:11 AM

Confirmations

6,485,709

Merkle Root

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

9.977 × 10⁹⁹(100-digit number)
99772598850616389110…47161158079017567899
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
9.977 × 10⁹⁹(100-digit number)
99772598850616389110…47161158079017567899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.995 × 10¹⁰⁰(101-digit number)
19954519770123277822…94322316158035135799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.990 × 10¹⁰⁰(101-digit number)
39909039540246555644…88644632316070271599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.981 × 10¹⁰⁰(101-digit number)
79818079080493111288…77289264632140543199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.596 × 10¹⁰¹(102-digit number)
15963615816098622257…54578529264281086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.192 × 10¹⁰¹(102-digit number)
31927231632197244515…09157058528562172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.385 × 10¹⁰¹(102-digit number)
63854463264394489030…18314117057124345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.277 × 10¹⁰²(103-digit number)
12770892652878897806…36628234114248691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.554 × 10¹⁰²(103-digit number)
25541785305757795612…73256468228497382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.108 × 10¹⁰²(103-digit number)
51083570611515591224…46512936456994764799
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,732,939 XPM·at block #6,811,103 · 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