Block #330,279

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 1:44:51 PM · Difficulty 10.1679 · 6,484,696 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
76b48b7fff7753ea5aab691fbc4babe6884fd2a68db124811cddc481fe6f27e0

Height

#330,279

Difficulty

10.167892

Transactions

3

Size

38.34 KB

Version

2

Bits

0a2afaf8

Nonce

9,107

Timestamp

12/26/2013, 1:44:51 PM

Confirmations

6,484,696

Merkle Root

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

4.759 × 10¹⁰³(104-digit number)
47591402636716780847…11351621441148234879
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
4.759 × 10¹⁰³(104-digit number)
47591402636716780847…11351621441148234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.518 × 10¹⁰³(104-digit number)
95182805273433561694…22703242882296469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.903 × 10¹⁰⁴(105-digit number)
19036561054686712338…45406485764592939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.807 × 10¹⁰⁴(105-digit number)
38073122109373424677…90812971529185879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.614 × 10¹⁰⁴(105-digit number)
76146244218746849355…81625943058371758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.522 × 10¹⁰⁵(106-digit number)
15229248843749369871…63251886116743516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.045 × 10¹⁰⁵(106-digit number)
30458497687498739742…26503772233487032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.091 × 10¹⁰⁵(106-digit number)
60916995374997479484…53007544466974064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.218 × 10¹⁰⁶(107-digit number)
12183399074999495896…06015088933948129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.436 × 10¹⁰⁶(107-digit number)
24366798149998991793…12030177867896258559
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,763,887 XPM·at block #6,814,974 · 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