Block #339,836

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2014, 9:11:23 AM · Difficulty 10.1299 · 6,466,912 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
873ea51627dbbb2c377aefdbcdbba798d4c77ce9790902f88dc2211b9cb102a9

Height

#339,836

Difficulty

10.129918

Transactions

4

Size

992 B

Version

2

Bits

0a214248

Nonce

11,905

Timestamp

1/2/2014, 9:11:23 AM

Confirmations

6,466,912

Merkle Root

61cc517834a7834554f32938c9a442e72c627f3ff245b25f7b84a9f82307b3df
Transactions (4)
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.

8.357 × 10⁹⁴(95-digit number)
83577013146879159783…14445913299582232199
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
8.357 × 10⁹⁴(95-digit number)
83577013146879159783…14445913299582232199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.671 × 10⁹⁵(96-digit number)
16715402629375831956…28891826599164464399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.343 × 10⁹⁵(96-digit number)
33430805258751663913…57783653198328928799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.686 × 10⁹⁵(96-digit number)
66861610517503327826…15567306396657857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.337 × 10⁹⁶(97-digit number)
13372322103500665565…31134612793315715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.674 × 10⁹⁶(97-digit number)
26744644207001331130…62269225586631430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.348 × 10⁹⁶(97-digit number)
53489288414002662261…24538451173262860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.069 × 10⁹⁷(98-digit number)
10697857682800532452…49076902346525721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.139 × 10⁹⁷(98-digit number)
21395715365601064904…98153804693051443199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.279 × 10⁹⁷(98-digit number)
42791430731202129809…96307609386102886399
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,698,082 XPM·at block #6,806,747 · 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.

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