Block #375,833

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/26/2014, 12:03:11 AM · Difficulty 10.4232 · 6,448,818 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ecd4f69285f06a4f0475c1b3d4d7efac99e8570368983f6a15cb525145b16884

Height

#375,833

Difficulty

10.423152

Transactions

5

Size

1.23 KB

Version

2

Bits

0a6c53ad

Nonce

44,025

Timestamp

1/26/2014, 12:03:11 AM

Confirmations

6,448,818

Merkle Root

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

8.404 × 10⁹⁵(96-digit number)
84041588435095342068…49104321073281791999
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
8.404 × 10⁹⁵(96-digit number)
84041588435095342068…49104321073281791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.680 × 10⁹⁶(97-digit number)
16808317687019068413…98208642146563583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.361 × 10⁹⁶(97-digit number)
33616635374038136827…96417284293127167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.723 × 10⁹⁶(97-digit number)
67233270748076273654…92834568586254335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.344 × 10⁹⁷(98-digit number)
13446654149615254730…85669137172508671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.689 × 10⁹⁷(98-digit number)
26893308299230509461…71338274345017343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.378 × 10⁹⁷(98-digit number)
53786616598461018923…42676548690034687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.075 × 10⁹⁸(99-digit number)
10757323319692203784…85353097380069375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.151 × 10⁹⁸(99-digit number)
21514646639384407569…70706194760138751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.302 × 10⁹⁸(99-digit number)
43029293278768815139…41412389520277503999
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,841,273 XPM·at block #6,824,650 · 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