Block #198,273

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/7/2013, 3:46:20 PM · Difficulty 9.8849 · 6,614,191 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6377ab1c5cf79d719217280555a796cef6d7168e3e7042af208b506d18f60d23

Height

#198,273

Difficulty

9.884872

Transactions

5

Size

48.98 KB

Version

2

Bits

09e28701

Nonce

210,422

Timestamp

10/7/2013, 3:46:20 PM

Confirmations

6,614,191

Merkle Root

5fa3cbe668f0afaeea0d9fb905f66a3c6d381a5d370085c3a07c59e496b48563
Transactions (5)
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.417 × 10⁹³(94-digit number)
34171081296027635684…72568235977944276479
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.417 × 10⁹³(94-digit number)
34171081296027635684…72568235977944276479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.834 × 10⁹³(94-digit number)
68342162592055271368…45136471955888552959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.366 × 10⁹⁴(95-digit number)
13668432518411054273…90272943911777105919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.733 × 10⁹⁴(95-digit number)
27336865036822108547…80545887823554211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.467 × 10⁹⁴(95-digit number)
54673730073644217094…61091775647108423679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.093 × 10⁹⁵(96-digit number)
10934746014728843418…22183551294216847359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.186 × 10⁹⁵(96-digit number)
21869492029457686837…44367102588433694719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.373 × 10⁹⁵(96-digit number)
43738984058915373675…88734205176867389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.747 × 10⁹⁵(96-digit number)
87477968117830747351…77468410353734778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.749 × 10⁹⁶(97-digit number)
17495593623566149470…54936820707469557759
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,743,738 XPM·at block #6,812,463 · 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