Block #373,933

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/24/2014, 3:49:05 PM · Difficulty 10.4267 · 6,435,853 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e91c111009eeebe142d03a441fa0853bbc1e4ff109b3951eb0a7d36f548e0382

Height

#373,933

Difficulty

10.426723

Transactions

4

Size

3.04 KB

Version

2

Bits

0a6d3dbf

Nonce

589,723

Timestamp

1/24/2014, 3:49:05 PM

Confirmations

6,435,853

Merkle Root

81b921e350e62dd3c6d2bbc3443b726559f102cf1538f43ae13bad75cdb8565d
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.739 × 10⁹⁸(99-digit number)
37390544015117774829…19795939348322938879
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.739 × 10⁹⁸(99-digit number)
37390544015117774829…19795939348322938879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.478 × 10⁹⁸(99-digit number)
74781088030235549658…39591878696645877759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.495 × 10⁹⁹(100-digit number)
14956217606047109931…79183757393291755519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.991 × 10⁹⁹(100-digit number)
29912435212094219863…58367514786583511039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.982 × 10⁹⁹(100-digit number)
59824870424188439726…16735029573167022079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.196 × 10¹⁰⁰(101-digit number)
11964974084837687945…33470059146334044159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.392 × 10¹⁰⁰(101-digit number)
23929948169675375890…66940118292668088319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.785 × 10¹⁰⁰(101-digit number)
47859896339350751781…33880236585336176639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.571 × 10¹⁰⁰(101-digit number)
95719792678701503562…67760473170672353279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.914 × 10¹⁰¹(102-digit number)
19143958535740300712…35520946341344706559
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,368 XPM·at block #6,809,785 · 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