Block #388,442

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/3/2014, 7:27:36 PM · Difficulty 10.4185 · 6,427,689 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
62c63e013c47af4635dca5b8dba8ad4867eb9327f51c7445ece592c46a528dab

Height

#388,442

Difficulty

10.418457

Transactions

4

Size

1.66 KB

Version

2

Bits

0a6b1ffb

Nonce

173,021

Timestamp

2/3/2014, 7:27:36 PM

Confirmations

6,427,689

Merkle Root

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

2.844 × 10⁹⁹(100-digit number)
28448358617532625020…61364220776140592799
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
2.844 × 10⁹⁹(100-digit number)
28448358617532625020…61364220776140592799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.689 × 10⁹⁹(100-digit number)
56896717235065250041…22728441552281185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.137 × 10¹⁰⁰(101-digit number)
11379343447013050008…45456883104562371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.275 × 10¹⁰⁰(101-digit number)
22758686894026100016…90913766209124742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.551 × 10¹⁰⁰(101-digit number)
45517373788052200033…81827532418249484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.103 × 10¹⁰⁰(101-digit number)
91034747576104400066…63655064836498969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.820 × 10¹⁰¹(102-digit number)
18206949515220880013…27310129672997939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.641 × 10¹⁰¹(102-digit number)
36413899030441760026…54620259345995878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.282 × 10¹⁰¹(102-digit number)
72827798060883520053…09240518691991756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.456 × 10¹⁰²(103-digit number)
14565559612176704010…18481037383983513599
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,773,174 XPM·at block #6,816,130 · 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