Block #295,935

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2013, 5:30:52 PM · Difficulty 9.9916 · 6,510,622 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ac350adbd9a2366fd67fe544dec9272e049e2e851ede93c73d555d1a0280c2f1

Height

#295,935

Difficulty

9.991558

Transactions

3

Size

800 B

Version

2

Bits

09fdd6bc

Nonce

148,264

Timestamp

12/5/2013, 5:30:52 PM

Confirmations

6,510,622

Merkle Root

4980bfbdc5fd1e5e7c949ab9c7534ba6a50e4cd2b8700d483f29177a0662a576
Transactions (3)
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.

6.837 × 10⁹³(94-digit number)
68374858740823950522…91588837235907193599
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
6.837 × 10⁹³(94-digit number)
68374858740823950522…91588837235907193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.367 × 10⁹⁴(95-digit number)
13674971748164790104…83177674471814387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.734 × 10⁹⁴(95-digit number)
27349943496329580208…66355348943628774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.469 × 10⁹⁴(95-digit number)
54699886992659160417…32710697887257548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.093 × 10⁹⁵(96-digit number)
10939977398531832083…65421395774515097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.187 × 10⁹⁵(96-digit number)
21879954797063664167…30842791549030195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.375 × 10⁹⁵(96-digit number)
43759909594127328334…61685583098060390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.751 × 10⁹⁵(96-digit number)
87519819188254656668…23371166196120780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.750 × 10⁹⁶(97-digit number)
17503963837650931333…46742332392241561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.500 × 10⁹⁶(97-digit number)
35007927675301862667…93484664784483123199
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,696,551 XPM·at block #6,806,556 · 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