Block #330,451

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 4:22:26 PM · Difficulty 10.1703 · 6,485,872 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b67c1a9d384faf342f06d2b9c3184c2a95d34d1c7c51c144287a050f772a77a8

Height

#330,451

Difficulty

10.170300

Transactions

5

Size

1.08 KB

Version

2

Bits

0a2b98c2

Nonce

9,176

Timestamp

12/26/2013, 4:22:26 PM

Confirmations

6,485,872

Merkle Root

fd7e6bcba9880b3e890bd7c5293db0b59869b34f53ff4582a0439b1b15efee80
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.

3.280 × 10¹⁰²(103-digit number)
32808007904251744550…57938187606806791679
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
3.280 × 10¹⁰²(103-digit number)
32808007904251744550…57938187606806791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.561 × 10¹⁰²(103-digit number)
65616015808503489101…15876375213613583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.312 × 10¹⁰³(104-digit number)
13123203161700697820…31752750427227166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.624 × 10¹⁰³(104-digit number)
26246406323401395640…63505500854454333439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.249 × 10¹⁰³(104-digit number)
52492812646802791281…27011001708908666879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.049 × 10¹⁰⁴(105-digit number)
10498562529360558256…54022003417817333759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.099 × 10¹⁰⁴(105-digit number)
20997125058721116512…08044006835634667519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.199 × 10¹⁰⁴(105-digit number)
41994250117442233025…16088013671269335039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.398 × 10¹⁰⁴(105-digit number)
83988500234884466050…32176027342538670079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.679 × 10¹⁰⁵(106-digit number)
16797700046976893210…64352054685077340159
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,774,704 XPM·at block #6,816,322 · 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