Block #387,859

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/3/2014, 10:09:14 AM · Difficulty 10.4156 · 6,426,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
ecb375398b417c14f28acb4a14290e9f0fe9f1c48a05e1a27a3a92602748fc20

Height

#387,859

Difficulty

10.415578

Transactions

10

Size

2.83 KB

Version

2

Bits

0a6a6355

Nonce

71,279

Timestamp

2/3/2014, 10:09:14 AM

Confirmations

6,426,376

Merkle Root

c1e663b78beaf8da86cb779eef1f53661276736b39392aa0ccea77b163fe4626
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.

4.471 × 10⁹⁰(91-digit number)
44716890804798242444…01366327106803550959
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
4.471 × 10⁹⁰(91-digit number)
44716890804798242444…01366327106803550959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.943 × 10⁹⁰(91-digit number)
89433781609596484888…02732654213607101919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.788 × 10⁹¹(92-digit number)
17886756321919296977…05465308427214203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.577 × 10⁹¹(92-digit number)
35773512643838593955…10930616854428407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.154 × 10⁹¹(92-digit number)
71547025287677187911…21861233708856815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.430 × 10⁹²(93-digit number)
14309405057535437582…43722467417713630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.861 × 10⁹²(93-digit number)
28618810115070875164…87444934835427261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.723 × 10⁹²(93-digit number)
57237620230141750328…74889869670854522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.144 × 10⁹³(94-digit number)
11447524046028350065…49779739341709045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.289 × 10⁹³(94-digit number)
22895048092056700131…99559478683418091519
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,757,952 XPM·at block #6,814,234 · 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