Block #334,734

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/29/2013, 5:00:42 PM · Difficulty 10.1599 · 6,481,240 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
937f42642e0336f065fceb50fc8135a70de9bd0d030f7c606f3336920067c667

Height

#334,734

Difficulty

10.159943

Transactions

18

Size

7.27 KB

Version

2

Bits

0a28f20b

Nonce

252,788

Timestamp

12/29/2013, 5:00:42 PM

Confirmations

6,481,240

Merkle Root

2cabacd4c59a3c0d20db8f3fc5b09ede163761c8118081f0e3a180e2af7c2064
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.

1.946 × 10⁹⁵(96-digit number)
19468109389446196045…24440262871002499679
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
1.946 × 10⁹⁵(96-digit number)
19468109389446196045…24440262871002499679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.893 × 10⁹⁵(96-digit number)
38936218778892392091…48880525742004999359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.787 × 10⁹⁵(96-digit number)
77872437557784784183…97761051484009998719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.557 × 10⁹⁶(97-digit number)
15574487511556956836…95522102968019997439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.114 × 10⁹⁶(97-digit number)
31148975023113913673…91044205936039994879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.229 × 10⁹⁶(97-digit number)
62297950046227827346…82088411872079989759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.245 × 10⁹⁷(98-digit number)
12459590009245565469…64176823744159979519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.491 × 10⁹⁷(98-digit number)
24919180018491130938…28353647488319959039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.983 × 10⁹⁷(98-digit number)
49838360036982261877…56707294976639918079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.967 × 10⁹⁷(98-digit number)
99676720073964523754…13414589953279836159
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,771,904 XPM·at block #6,815,973 · 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