Block #1,386,027

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2015, 1:49:57 PM · Difficulty 10.8143 · 5,424,770 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b48463346daa14348e09bb17641c6fd995c6cdd5acc80eea634f996cf70e4c3c

Height

#1,386,027

Difficulty

10.814312

Transactions

2

Size

722 B

Version

2

Bits

0ad076c6

Nonce

117,448,168

Timestamp

12/26/2015, 1:49:57 PM

Confirmations

5,424,770

Merkle Root

dac057049a0222b04c3db4ba46dbdecc9dbaf25fb22f8764b45c6b97bf7411a2
Transactions (2)
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.

3.993 × 10⁹⁴(95-digit number)
39935919191899117510…44480352906786084399
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
3.993 × 10⁹⁴(95-digit number)
39935919191899117510…44480352906786084399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.987 × 10⁹⁴(95-digit number)
79871838383798235020…88960705813572168799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.597 × 10⁹⁵(96-digit number)
15974367676759647004…77921411627144337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.194 × 10⁹⁵(96-digit number)
31948735353519294008…55842823254288675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.389 × 10⁹⁵(96-digit number)
63897470707038588016…11685646508577350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.277 × 10⁹⁶(97-digit number)
12779494141407717603…23371293017154700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.555 × 10⁹⁶(97-digit number)
25558988282815435206…46742586034309401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.111 × 10⁹⁶(97-digit number)
51117976565630870413…93485172068618803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.022 × 10⁹⁷(98-digit number)
10223595313126174082…86970344137237606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.044 × 10⁹⁷(98-digit number)
20447190626252348165…73940688274475212799
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,730,475 XPM·at block #6,810,796 · 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