Block #330,522

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 5:41:37 PM · Difficulty 10.1689 · 6,485,613 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d3b71b0ee90ee26fe9afd4547759cea769d6f3cdb062a757192e9ef58405e485

Height

#330,522

Difficulty

10.168922

Transactions

11

Size

2.84 KB

Version

2

Bits

0a2b3e73

Nonce

2,923

Timestamp

12/26/2013, 5:41:37 PM

Confirmations

6,485,613

Merkle Root

81930aba9bf8832f5c75704bacd58b16fff061073c6d0210a219841a37cf4634
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.

5.501 × 10⁹⁶(97-digit number)
55014758183489585085…30255631554144922879
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
5.501 × 10⁹⁶(97-digit number)
55014758183489585085…30255631554144922879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.100 × 10⁹⁷(98-digit number)
11002951636697917017…60511263108289845759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.200 × 10⁹⁷(98-digit number)
22005903273395834034…21022526216579691519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.401 × 10⁹⁷(98-digit number)
44011806546791668068…42045052433159383039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.802 × 10⁹⁷(98-digit number)
88023613093583336136…84090104866318766079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.760 × 10⁹⁸(99-digit number)
17604722618716667227…68180209732637532159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.520 × 10⁹⁸(99-digit number)
35209445237433334454…36360419465275064319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.041 × 10⁹⁸(99-digit number)
70418890474866668909…72720838930550128639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.408 × 10⁹⁹(100-digit number)
14083778094973333781…45441677861100257279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.816 × 10⁹⁹(100-digit number)
28167556189946667563…90883355722200514559
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,773,206 XPM·at block #6,816,134 · 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