Block #398,431

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/10/2014, 5:24:32 PM · Difficulty 10.4256 · 6,416,518 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8011f18bdd2431009e7f39c8e97d9b7aa009a7c4ec940e1a43659f65be19498f

Height

#398,431

Difficulty

10.425633

Transactions

10

Size

4.07 KB

Version

2

Bits

0a6cf64c

Nonce

184,074

Timestamp

2/10/2014, 5:24:32 PM

Confirmations

6,416,518

Merkle Root

d6db69a3f3a612b8d3c43710ba4d225a8233a428f71395fa5dc1b5b45dafda59
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.788 × 10⁹²(93-digit number)
47889652554315446937…38451449465361298959
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.788 × 10⁹²(93-digit number)
47889652554315446937…38451449465361298959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.577 × 10⁹²(93-digit number)
95779305108630893874…76902898930722597919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.915 × 10⁹³(94-digit number)
19155861021726178774…53805797861445195839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.831 × 10⁹³(94-digit number)
38311722043452357549…07611595722890391679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.662 × 10⁹³(94-digit number)
76623444086904715099…15223191445780783359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.532 × 10⁹⁴(95-digit number)
15324688817380943019…30446382891561566719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.064 × 10⁹⁴(95-digit number)
30649377634761886039…60892765783123133439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.129 × 10⁹⁴(95-digit number)
61298755269523772079…21785531566246266879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.225 × 10⁹⁵(96-digit number)
12259751053904754415…43571063132492533759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.451 × 10⁹⁵(96-digit number)
24519502107809508831…87142126264985067519
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,763,689 XPM·at block #6,814,948 · 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