Block #389,604

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/4/2014, 2:37:40 PM · Difficulty 10.4207 · 6,418,320 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f715cb4a77e4261d6d9fe1c336191e25f95e232cebdd35756d2d4bd9b9ada4cf

Height

#389,604

Difficulty

10.420662

Transactions

5

Size

1.29 KB

Version

2

Bits

0a6bb089

Nonce

316,627

Timestamp

2/4/2014, 2:37:40 PM

Confirmations

6,418,320

Merkle Root

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

7.613 × 10⁹⁹(100-digit number)
76139355742189115576…81445037472098513199
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
7.613 × 10⁹⁹(100-digit number)
76139355742189115576…81445037472098513199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.522 × 10¹⁰⁰(101-digit number)
15227871148437823115…62890074944197026399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.045 × 10¹⁰⁰(101-digit number)
30455742296875646230…25780149888394052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.091 × 10¹⁰⁰(101-digit number)
60911484593751292461…51560299776788105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.218 × 10¹⁰¹(102-digit number)
12182296918750258492…03120599553576211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.436 × 10¹⁰¹(102-digit number)
24364593837500516984…06241199107152422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.872 × 10¹⁰¹(102-digit number)
48729187675001033969…12482398214304844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.745 × 10¹⁰¹(102-digit number)
97458375350002067938…24964796428609689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.949 × 10¹⁰²(103-digit number)
19491675070000413587…49929592857219379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.898 × 10¹⁰²(103-digit number)
38983350140000827175…99859185714438758399
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,428 XPM·at block #6,807,923 · 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