Block #335,018

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/29/2013, 9:43:55 PM · Difficulty 10.1600 · 6,482,965 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd30f101e4a03d927d130b653ea32063e7f3106c1189e2b2897cf74d1e9bb50d

Height

#335,018

Difficulty

10.159963

Transactions

12

Size

2.92 KB

Version

2

Bits

0a28f356

Nonce

6,658

Timestamp

12/29/2013, 9:43:55 PM

Confirmations

6,482,965

Merkle Root

5295a7bd5bebf8ace1218d4d583d991be6a80af8a3a8a4e47610d631b2df42ce
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.938 × 10⁹⁵(96-digit number)
19382856873191658440…64450370892894111359
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.938 × 10⁹⁵(96-digit number)
19382856873191658440…64450370892894111359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.876 × 10⁹⁵(96-digit number)
38765713746383316881…28900741785788222719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.753 × 10⁹⁵(96-digit number)
77531427492766633762…57801483571576445439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.550 × 10⁹⁶(97-digit number)
15506285498553326752…15602967143152890879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.101 × 10⁹⁶(97-digit number)
31012570997106653504…31205934286305781759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.202 × 10⁹⁶(97-digit number)
62025141994213307009…62411868572611563519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.240 × 10⁹⁷(98-digit number)
12405028398842661401…24823737145223127039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.481 × 10⁹⁷(98-digit number)
24810056797685322803…49647474290446254079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.962 × 10⁹⁷(98-digit number)
49620113595370645607…99294948580892508159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.924 × 10⁹⁷(98-digit number)
99240227190741291215…98589897161785016319
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,787,935 XPM·at block #6,817,982 · 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