Block #370,094

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2014, 8:22:42 PM · Difficulty 10.4487 · 6,436,869 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c97695c56715672101e99664be639776e989e547441b9501a9fdd77bff022d0

Height

#370,094

Difficulty

10.448651

Transactions

5

Size

1.09 KB

Version

2

Bits

0a72dac7

Nonce

61,348

Timestamp

1/21/2014, 8:22:42 PM

Confirmations

6,436,869

Merkle Root

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

1.077 × 10¹⁰⁷(108-digit number)
10774255831842077193…43715968561379225599
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
1.077 × 10¹⁰⁷(108-digit number)
10774255831842077193…43715968561379225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.154 × 10¹⁰⁷(108-digit number)
21548511663684154386…87431937122758451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.309 × 10¹⁰⁷(108-digit number)
43097023327368308772…74863874245516902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.619 × 10¹⁰⁷(108-digit number)
86194046654736617544…49727748491033804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.723 × 10¹⁰⁸(109-digit number)
17238809330947323508…99455496982067609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.447 × 10¹⁰⁸(109-digit number)
34477618661894647017…98910993964135219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.895 × 10¹⁰⁸(109-digit number)
68955237323789294035…97821987928270438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.379 × 10¹⁰⁹(110-digit number)
13791047464757858807…95643975856540876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.758 × 10¹⁰⁹(110-digit number)
27582094929515717614…91287951713081753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.516 × 10¹⁰⁹(110-digit number)
55164189859031435228…82575903426163507199
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,699,803 XPM·at block #6,806,962 · 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