Block #330,332

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 2:40:04 PM · Difficulty 10.1676 · 6,507,959 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7f23cc1f130570b0c5f697fa9ee87b3f7ecc629621dc613ed43a861d772ecae0

Height

#330,332

Difficulty

10.167610

Transactions

6

Size

1.73 KB

Version

2

Bits

0a2ae876

Nonce

186,022

Timestamp

12/26/2013, 2:40:04 PM

Confirmations

6,507,959

Merkle Root

9107eca9d7413a9ccaceb3df4f73b4962c5272daaf9b640fc34878e73a75f420
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.861 × 10⁹⁶(97-digit number)
38612946092615321242…55428317539121779019
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.861 × 10⁹⁶(97-digit number)
38612946092615321242…55428317539121779019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.722 × 10⁹⁶(97-digit number)
77225892185230642485…10856635078243558039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.544 × 10⁹⁷(98-digit number)
15445178437046128497…21713270156487116079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.089 × 10⁹⁷(98-digit number)
30890356874092256994…43426540312974232159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.178 × 10⁹⁷(98-digit number)
61780713748184513988…86853080625948464319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.235 × 10⁹⁸(99-digit number)
12356142749636902797…73706161251896928639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.471 × 10⁹⁸(99-digit number)
24712285499273805595…47412322503793857279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.942 × 10⁹⁸(99-digit number)
49424570998547611190…94824645007587714559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.884 × 10⁹⁸(99-digit number)
98849141997095222380…89649290015175429119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.976 × 10⁹⁹(100-digit number)
19769828399419044476…79298580030350858239
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,950,602 XPM·at block #6,838,290 · 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