Block #388,535

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/3/2014, 9:01:39 PM · Difficulty 10.4185 · 6,436,771 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a87bc8443a6bfc26b5c5b067126715ef810d300fc5ebcd7ada015727a5469b6

Height

#388,535

Difficulty

10.418453

Transactions

2

Size

877 B

Version

2

Bits

0a6b1fb5

Nonce

29,751

Timestamp

2/3/2014, 9:01:39 PM

Confirmations

6,436,771

Merkle Root

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

8.451 × 10⁹⁸(99-digit number)
84512187749488159402…80745035079558430719
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
8.451 × 10⁹⁸(99-digit number)
84512187749488159402…80745035079558430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.690 × 10⁹⁹(100-digit number)
16902437549897631880…61490070159116861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.380 × 10⁹⁹(100-digit number)
33804875099795263761…22980140318233722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.760 × 10⁹⁹(100-digit number)
67609750199590527522…45960280636467445759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.352 × 10¹⁰⁰(101-digit number)
13521950039918105504…91920561272934891519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.704 × 10¹⁰⁰(101-digit number)
27043900079836211008…83841122545869783039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.408 × 10¹⁰⁰(101-digit number)
54087800159672422017…67682245091739566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.081 × 10¹⁰¹(102-digit number)
10817560031934484403…35364490183479132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.163 × 10¹⁰¹(102-digit number)
21635120063868968807…70728980366958264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.327 × 10¹⁰¹(102-digit number)
43270240127737937614…41457960733916528639
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,846,550 XPM·at block #6,825,305 · 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