Block #375,872

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/26/2014, 12:53:35 AM · Difficulty 10.4219 · 6,436,178 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56a5fa9b741f079bd25e2c05532ab2f571992efdacec6bf71e2adf9f18525ec3

Height

#375,872

Difficulty

10.421896

Transactions

6

Size

1.57 KB

Version

2

Bits

0a6c015f

Nonce

3,144

Timestamp

1/26/2014, 12:53:35 AM

Confirmations

6,436,178

Merkle Root

ea97cafd2e01ac0f2e625f229c2b8a18377a546dc0709a7df95738ffdf8f1ce6
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.925 × 10¹⁰⁴(105-digit number)
29252752367614265759…90672645108919173119
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.925 × 10¹⁰⁴(105-digit number)
29252752367614265759…90672645108919173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.850 × 10¹⁰⁴(105-digit number)
58505504735228531519…81345290217838346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.170 × 10¹⁰⁵(106-digit number)
11701100947045706303…62690580435676692479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.340 × 10¹⁰⁵(106-digit number)
23402201894091412607…25381160871353384959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.680 × 10¹⁰⁵(106-digit number)
46804403788182825215…50762321742706769919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.360 × 10¹⁰⁵(106-digit number)
93608807576365650431…01524643485413539839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.872 × 10¹⁰⁶(107-digit number)
18721761515273130086…03049286970827079679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.744 × 10¹⁰⁶(107-digit number)
37443523030546260172…06098573941654159359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.488 × 10¹⁰⁶(107-digit number)
74887046061092520345…12197147883308318719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.497 × 10¹⁰⁷(108-digit number)
14977409212218504069…24394295766616637439
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,740,506 XPM·at block #6,812,049 · 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