Block #320,939

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 12:06:25 AM · Difficulty 10.1852 · 6,493,376 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
187c4377b423b0c79b3ea2c766d009fca46dcf46e0ee7dceb4c14a17beecd669

Height

#320,939

Difficulty

10.185203

Transactions

4

Size

1.10 KB

Version

2

Bits

0a2f697a

Nonce

23,623

Timestamp

12/20/2013, 12:06:25 AM

Confirmations

6,493,376

Merkle Root

6af8c85ee69789236bf1e6cff46e4af6aa32060b138dd39cdcacddc02495a1a8
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.

2.102 × 10⁹³(94-digit number)
21026360911121533752…65625980186403741439
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
2.102 × 10⁹³(94-digit number)
21026360911121533752…65625980186403741439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.205 × 10⁹³(94-digit number)
42052721822243067505…31251960372807482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.410 × 10⁹³(94-digit number)
84105443644486135010…62503920745614965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.682 × 10⁹⁴(95-digit number)
16821088728897227002…25007841491229931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.364 × 10⁹⁴(95-digit number)
33642177457794454004…50015682982459863039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.728 × 10⁹⁴(95-digit number)
67284354915588908008…00031365964919726079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.345 × 10⁹⁵(96-digit number)
13456870983117781601…00062731929839452159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.691 × 10⁹⁵(96-digit number)
26913741966235563203…00125463859678904319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.382 × 10⁹⁵(96-digit number)
53827483932471126406…00250927719357808639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.076 × 10⁹⁶(97-digit number)
10765496786494225281…00501855438715617279
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,758,583 XPM·at block #6,814,314 · 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