Block #333,945

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/29/2013, 3:59:46 AM · Difficulty 10.1580 · 6,490,892 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
34edd93956d690e5221578100e40e124e24f4e8a647c9a67727fa292c5048b11

Height

#333,945

Difficulty

10.158038

Transactions

8

Size

1.71 KB

Version

2

Bits

0a28752c

Nonce

31,908

Timestamp

12/29/2013, 3:59:46 AM

Confirmations

6,490,892

Merkle Root

0366af5cb4bfbc430ca9a6263290946743695d51f01cb6246721901c814cfcec
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.

8.232 × 10⁹⁸(99-digit number)
82324412939893907989…72147883024502062079
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
8.232 × 10⁹⁸(99-digit number)
82324412939893907989…72147883024502062079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.646 × 10⁹⁹(100-digit number)
16464882587978781597…44295766049004124159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.292 × 10⁹⁹(100-digit number)
32929765175957563195…88591532098008248319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.585 × 10⁹⁹(100-digit number)
65859530351915126391…77183064196016496639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.317 × 10¹⁰⁰(101-digit number)
13171906070383025278…54366128392032993279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.634 × 10¹⁰⁰(101-digit number)
26343812140766050556…08732256784065986559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.268 × 10¹⁰⁰(101-digit number)
52687624281532101113…17464513568131973119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.053 × 10¹⁰¹(102-digit number)
10537524856306420222…34929027136263946239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.107 × 10¹⁰¹(102-digit number)
21075049712612840445…69858054272527892479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.215 × 10¹⁰¹(102-digit number)
42150099425225680890…39716108545055784959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.430 × 10¹⁰¹(102-digit number)
84300198850451361780…79432217090111569919
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,842,776 XPM·at block #6,824,836 · 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