Block #375,675

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 9:19:09 PM · Difficulty 10.4242 · 6,440,259 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8331ef68e4c10184635d8fb5c665c7a801a68a76abcf84a53c6b4d969b5a1133

Height

#375,675

Difficulty

10.424249

Transactions

13

Size

8.16 KB

Version

2

Bits

0a6c9b96

Nonce

292,646

Timestamp

1/25/2014, 9:19:09 PM

Confirmations

6,440,259

Merkle Root

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

7.341 × 10⁹⁶(97-digit number)
73419634965124274369…13223601707304216319
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
7.341 × 10⁹⁶(97-digit number)
73419634965124274369…13223601707304216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.468 × 10⁹⁷(98-digit number)
14683926993024854873…26447203414608432639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.936 × 10⁹⁷(98-digit number)
29367853986049709747…52894406829216865279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.873 × 10⁹⁷(98-digit number)
58735707972099419495…05788813658433730559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.174 × 10⁹⁸(99-digit number)
11747141594419883899…11577627316867461119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.349 × 10⁹⁸(99-digit number)
23494283188839767798…23155254633734922239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.698 × 10⁹⁸(99-digit number)
46988566377679535596…46310509267469844479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.397 × 10⁹⁸(99-digit number)
93977132755359071192…92621018534939688959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.879 × 10⁹⁹(100-digit number)
18795426551071814238…85242037069879377919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.759 × 10⁹⁹(100-digit number)
37590853102143628476…70484074139758755839
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,771,584 XPM·at block #6,815,933 · 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