Block #336,589

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2013, 1:48:47 AM · Difficulty 10.1415 · 6,490,643 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
767ad6a935bc8abc5cccf002c044e2a1092f1c9e8cca87dd34304141ce59119d

Height

#336,589

Difficulty

10.141542

Transactions

5

Size

1.66 KB

Version

2

Bits

0a243c1a

Nonce

165,993

Timestamp

12/31/2013, 1:48:47 AM

Confirmations

6,490,643

Merkle Root

b94fa03f655935472e1b6cc5c4d6066d8436411edab35a2366f6b550e85ae9a1
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.779 × 10⁹⁷(98-digit number)
17791676084852925180…42580770686600943389
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.779 × 10⁹⁷(98-digit number)
17791676084852925180…42580770686600943389
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.558 × 10⁹⁷(98-digit number)
35583352169705850360…85161541373201886779
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.116 × 10⁹⁷(98-digit number)
71166704339411700720…70323082746403773559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.423 × 10⁹⁸(99-digit number)
14233340867882340144…40646165492807547119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.846 × 10⁹⁸(99-digit number)
28466681735764680288…81292330985615094239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.693 × 10⁹⁸(99-digit number)
56933363471529360576…62584661971230188479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.138 × 10⁹⁹(100-digit number)
11386672694305872115…25169323942460376959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.277 × 10⁹⁹(100-digit number)
22773345388611744230…50338647884920753919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.554 × 10⁹⁹(100-digit number)
45546690777223488461…00677295769841507839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.109 × 10⁹⁹(100-digit number)
91093381554446976922…01354591539683015679
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,861,956 XPM·at block #6,827,231 · 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