Block #386,990

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/2/2014, 7:55:28 PM · Difficulty 10.4134 · 6,420,989 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2fd5723f9014e3070e80b58de78e62de975b065c3a16edd9b40a42eac5e8d24d

Height

#386,990

Difficulty

10.413449

Transactions

8

Size

3.04 KB

Version

2

Bits

0a69d7c8

Nonce

48,249

Timestamp

2/2/2014, 7:55:28 PM

Confirmations

6,420,989

Merkle Root

407d13d945dc747169085232245fb3b3d429b7cf5fb77b8db9c83475e5e77ac6
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.916 × 10⁹⁸(99-digit number)
19166076095189293137…76987707613301879999
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.916 × 10⁹⁸(99-digit number)
19166076095189293137…76987707613301879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.833 × 10⁹⁸(99-digit number)
38332152190378586274…53975415226603759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.666 × 10⁹⁸(99-digit number)
76664304380757172549…07950830453207519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.533 × 10⁹⁹(100-digit number)
15332860876151434509…15901660906415039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.066 × 10⁹⁹(100-digit number)
30665721752302869019…31803321812830079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.133 × 10⁹⁹(100-digit number)
61331443504605738039…63606643625660159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.226 × 10¹⁰⁰(101-digit number)
12266288700921147607…27213287251320319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.453 × 10¹⁰⁰(101-digit number)
24532577401842295215…54426574502640639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.906 × 10¹⁰⁰(101-digit number)
49065154803684590431…08853149005281279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.813 × 10¹⁰⁰(101-digit number)
98130309607369180863…17706298010562559999
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,707,877 XPM·at block #6,807,978 · 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