Block #329,634

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 2:55:18 AM · Difficulty 10.1686 · 6,515,757 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
553d37bef2e7a592f477cb74f1b56151521f327cc15efa0c44f87a9657c8faa4

Height

#329,634

Difficulty

10.168559

Transactions

1

Size

1.08 KB

Version

2

Bits

0a2b26b2

Nonce

180,283

Timestamp

12/26/2013, 2:55:18 AM

Confirmations

6,515,757

Merkle Root

05bdaef2582b17b2e45861f095089eedd0a7f021a35011d661c2f029b0e76ad4
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.160 × 10⁹⁴(95-digit number)
31609773108396926619…55208310486194094559
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.160 × 10⁹⁴(95-digit number)
31609773108396926619…55208310486194094559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.321 × 10⁹⁴(95-digit number)
63219546216793853238…10416620972388189119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.264 × 10⁹⁵(96-digit number)
12643909243358770647…20833241944776378239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.528 × 10⁹⁵(96-digit number)
25287818486717541295…41666483889552756479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.057 × 10⁹⁵(96-digit number)
50575636973435082590…83332967779105512959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.011 × 10⁹⁶(97-digit number)
10115127394687016518…66665935558211025919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.023 × 10⁹⁶(97-digit number)
20230254789374033036…33331871116422051839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.046 × 10⁹⁶(97-digit number)
40460509578748066072…66663742232844103679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.092 × 10⁹⁶(97-digit number)
80921019157496132144…33327484465688207359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.618 × 10⁹⁷(98-digit number)
16184203831499226428…66654968931376414719
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:58,007,574 XPM·at block #6,845,390 · 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