Block #238,879

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/1/2013, 6:49:15 PM · Difficulty 9.9535 · 6,570,915 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb1ef0737254b7cd5c94cce241bde322f1bb32268942da66755db5374733b029

Height

#238,879

Difficulty

9.953491

Transactions

5

Size

1.25 KB

Version

2

Bits

09f417f9

Nonce

37,461

Timestamp

11/1/2013, 6:49:15 PM

Confirmations

6,570,915

Merkle Root

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

2.942 × 10⁹⁹(100-digit number)
29429713041202293927…53826401578795610319
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
2.942 × 10⁹⁹(100-digit number)
29429713041202293927…53826401578795610319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.885 × 10⁹⁹(100-digit number)
58859426082404587854…07652803157591220639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.177 × 10¹⁰⁰(101-digit number)
11771885216480917570…15305606315182441279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.354 × 10¹⁰⁰(101-digit number)
23543770432961835141…30611212630364882559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.708 × 10¹⁰⁰(101-digit number)
47087540865923670283…61222425260729765119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.417 × 10¹⁰⁰(101-digit number)
94175081731847340566…22444850521459530239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.883 × 10¹⁰¹(102-digit number)
18835016346369468113…44889701042919060479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.767 × 10¹⁰¹(102-digit number)
37670032692738936226…89779402085838120959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.534 × 10¹⁰¹(102-digit number)
75340065385477872453…79558804171676241919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.506 × 10¹⁰²(103-digit number)
15068013077095574490…59117608343352483839
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,432 XPM·at block #6,809,793 · 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