Block #375,723

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 10:03:30 PM · Difficulty 10.4244 · 6,432,470 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48f48089e855e87e814714a4f37ab6f221797de1a3ac0ced7d44760b5ba3ba40

Height

#375,723

Difficulty

10.424432

Transactions

9

Size

2.10 KB

Version

2

Bits

0a6ca78f

Nonce

126,363

Timestamp

1/25/2014, 10:03:30 PM

Confirmations

6,432,470

Merkle Root

3c4e010908495f9100874836da1d8bc83b02e4c473dbff4ab00602cb8beb5334
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.

6.126 × 10⁹⁸(99-digit number)
61268818951479194555…36806856264467056259
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
6.126 × 10⁹⁸(99-digit number)
61268818951479194555…36806856264467056259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.225 × 10⁹⁹(100-digit number)
12253763790295838911…73613712528934112519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.450 × 10⁹⁹(100-digit number)
24507527580591677822…47227425057868225039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.901 × 10⁹⁹(100-digit number)
49015055161183355644…94454850115736450079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.803 × 10⁹⁹(100-digit number)
98030110322366711288…88909700231472900159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.960 × 10¹⁰⁰(101-digit number)
19606022064473342257…77819400462945800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.921 × 10¹⁰⁰(101-digit number)
39212044128946684515…55638800925891600639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.842 × 10¹⁰⁰(101-digit number)
78424088257893369031…11277601851783201279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.568 × 10¹⁰¹(102-digit number)
15684817651578673806…22555203703566402559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.136 × 10¹⁰¹(102-digit number)
31369635303157347612…45110407407132805119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.273 × 10¹⁰¹(102-digit number)
62739270606314695224…90220814814265610239
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,709,595 XPM·at block #6,808,192 · 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