Block #515,158

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2014, 3:00:34 PM · Difficulty 10.8402 · 6,293,942 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b23997ea004238721dd833a4ac816f1b314ce045cb58065ca732130e5ecd0144

Height

#515,158

Difficulty

10.840221

Transactions

9

Size

2.62 KB

Version

2

Bits

0ad718bc

Nonce

628,695

Timestamp

4/28/2014, 3:00:34 PM

Confirmations

6,293,942

Merkle Root

5a1a2e1ab2f4af9c734a15eecd24fd73b80efadaf3aaa3620eca717eccbfd093
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.334 × 10⁹⁸(99-digit number)
73340099142020737008…73596569222838329039
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.334 × 10⁹⁸(99-digit number)
73340099142020737008…73596569222838329039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.466 × 10⁹⁹(100-digit number)
14668019828404147401…47193138445676658079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.933 × 10⁹⁹(100-digit number)
29336039656808294803…94386276891353316159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.867 × 10⁹⁹(100-digit number)
58672079313616589606…88772553782706632319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.173 × 10¹⁰⁰(101-digit number)
11734415862723317921…77545107565413264639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.346 × 10¹⁰⁰(101-digit number)
23468831725446635842…55090215130826529279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.693 × 10¹⁰⁰(101-digit number)
46937663450893271685…10180430261653058559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.387 × 10¹⁰⁰(101-digit number)
93875326901786543371…20360860523306117119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.877 × 10¹⁰¹(102-digit number)
18775065380357308674…40721721046612234239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.755 × 10¹⁰¹(102-digit number)
37550130760714617348…81443442093224468479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.510 × 10¹⁰¹(102-digit number)
75100261521429234696…62886884186448936959
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,716,854 XPM·at block #6,809,099 · 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