Block #331,372

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 8:10:02 AM · Difficulty 10.1663 · 6,478,462 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c0a839051e100cff9fc732da8765e5d5f358b71033b2441f8a32109a6685cc61

Height

#331,372

Difficulty

10.166294

Transactions

5

Size

1.08 KB

Version

2

Bits

0a2a923d

Nonce

269,240

Timestamp

12/27/2013, 8:10:02 AM

Confirmations

6,478,462

Merkle Root

d67e9b94f9464f89fdc332c51148f8b81e7065d95f636dea5bd9320788da7048
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.105 × 10¹⁰⁰(101-digit number)
11057233262219150633…41033477047093831679
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.105 × 10¹⁰⁰(101-digit number)
11057233262219150633…41033477047093831679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.211 × 10¹⁰⁰(101-digit number)
22114466524438301267…82066954094187663359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.422 × 10¹⁰⁰(101-digit number)
44228933048876602534…64133908188375326719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.845 × 10¹⁰⁰(101-digit number)
88457866097753205068…28267816376750653439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.769 × 10¹⁰¹(102-digit number)
17691573219550641013…56535632753501306879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.538 × 10¹⁰¹(102-digit number)
35383146439101282027…13071265507002613759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.076 × 10¹⁰¹(102-digit number)
70766292878202564054…26142531014005227519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.415 × 10¹⁰²(103-digit number)
14153258575640512810…52285062028010455039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.830 × 10¹⁰²(103-digit number)
28306517151281025621…04570124056020910079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.661 × 10¹⁰²(103-digit number)
56613034302562051243…09140248112041820159
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,722,758 XPM·at block #6,809,833 · 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