Block #110,541

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/11/2013, 12:24:20 AM · Difficulty 9.6931 · 6,700,487 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4942889324d0d994647569035c5d5f6be34d0c801b23ece6463b6d996eee4c7a

Height

#110,541

Difficulty

9.693136

Transactions

6

Size

1.23 KB

Version

2

Bits

09b17158

Nonce

158,433

Timestamp

8/11/2013, 12:24:20 AM

Confirmations

6,700,487

Merkle Root

73eb361f0c40b97fc2943878fb2c6d7d61cba4aba5801be3e1113862e549d6ac
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.874 × 10¹⁰¹(102-digit number)
78746471018900367024…90667486635462603999
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.874 × 10¹⁰¹(102-digit number)
78746471018900367024…90667486635462603999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.574 × 10¹⁰²(103-digit number)
15749294203780073404…81334973270925207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.149 × 10¹⁰²(103-digit number)
31498588407560146809…62669946541850415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.299 × 10¹⁰²(103-digit number)
62997176815120293619…25339893083700831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.259 × 10¹⁰³(104-digit number)
12599435363024058723…50679786167401663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.519 × 10¹⁰³(104-digit number)
25198870726048117447…01359572334803327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.039 × 10¹⁰³(104-digit number)
50397741452096234895…02719144669606655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.007 × 10¹⁰⁴(105-digit number)
10079548290419246979…05438289339213311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.015 × 10¹⁰⁴(105-digit number)
20159096580838493958…10876578678426623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.031 × 10¹⁰⁴(105-digit number)
40318193161676987916…21753157356853247999
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,732,332 XPM·at block #6,811,027 · 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