Block #321,123

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 3:02:38 AM · Difficulty 10.1866 · 6,494,794 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e2a15142e73098219fc77772e2a284bb717fd254d4cb62105b194f7eb5f7c677

Height

#321,123

Difficulty

10.186559

Transactions

14

Size

9.70 KB

Version

2

Bits

0a2fc254

Nonce

183,066

Timestamp

12/20/2013, 3:02:38 AM

Confirmations

6,494,794

Merkle Root

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

3.676 × 10¹⁰⁰(101-digit number)
36763006678632649812…99291381224688810239
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
3.676 × 10¹⁰⁰(101-digit number)
36763006678632649812…99291381224688810239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.352 × 10¹⁰⁰(101-digit number)
73526013357265299625…98582762449377620479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.470 × 10¹⁰¹(102-digit number)
14705202671453059925…97165524898755240959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.941 × 10¹⁰¹(102-digit number)
29410405342906119850…94331049797510481919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.882 × 10¹⁰¹(102-digit number)
58820810685812239700…88662099595020963839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.176 × 10¹⁰²(103-digit number)
11764162137162447940…77324199190041927679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.352 × 10¹⁰²(103-digit number)
23528324274324895880…54648398380083855359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.705 × 10¹⁰²(103-digit number)
47056648548649791760…09296796760167710719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.411 × 10¹⁰²(103-digit number)
94113297097299583520…18593593520335421439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.882 × 10¹⁰³(104-digit number)
18822659419459916704…37187187040670842879
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,771,446 XPM·at block #6,815,916 · 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