Block #386,656

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/2/2014, 2:36:12 PM · Difficulty 10.4113 · 6,427,384 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db771c0ecd321e6248de8f844483d4309a73d40e918bd54b53adabc66d359a5a

Height

#386,656

Difficulty

10.411336

Transactions

6

Size

1.32 KB

Version

2

Bits

0a694d50

Nonce

53,518

Timestamp

2/2/2014, 2:36:12 PM

Confirmations

6,427,384

Merkle Root

febf093ae1dabdc8358a6f07c47bfdf5e3d7f5d0d76019e30744034ef9c19ee1
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.035 × 10⁹⁴(95-digit number)
10353606728123111020…56653955657802465119
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.035 × 10⁹⁴(95-digit number)
10353606728123111020…56653955657802465119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.070 × 10⁹⁴(95-digit number)
20707213456246222040…13307911315604930239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.141 × 10⁹⁴(95-digit number)
41414426912492444081…26615822631209860479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.282 × 10⁹⁴(95-digit number)
82828853824984888162…53231645262419720959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.656 × 10⁹⁵(96-digit number)
16565770764996977632…06463290524839441919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.313 × 10⁹⁵(96-digit number)
33131541529993955264…12926581049678883839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.626 × 10⁹⁵(96-digit number)
66263083059987910529…25853162099357767679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.325 × 10⁹⁶(97-digit number)
13252616611997582105…51706324198715535359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.650 × 10⁹⁶(97-digit number)
26505233223995164211…03412648397431070719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.301 × 10⁹⁶(97-digit number)
53010466447990328423…06825296794862141439
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,756,395 XPM·at block #6,814,039 · 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