Block #394,431

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/7/2014, 10:36:09 PM · Difficulty 10.4250 · 6,422,295 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e46791b47b6979d2c21d4883c56be794a66b3ad9063c52cff0138587a79aabd8

Height

#394,431

Difficulty

10.425003

Transactions

5

Size

2.23 KB

Version

2

Bits

0a6cccf9

Nonce

4,750

Timestamp

2/7/2014, 10:36:09 PM

Confirmations

6,422,295

Merkle Root

7e11f63c0d5db3e088fc2eeb9c609f1a14b88ce79c09e4122bebea38894a5d85
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.552 × 10⁹⁵(96-digit number)
25525552265154692032…75913189453049412259
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.552 × 10⁹⁵(96-digit number)
25525552265154692032…75913189453049412259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.105 × 10⁹⁵(96-digit number)
51051104530309384065…51826378906098824519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.021 × 10⁹⁶(97-digit number)
10210220906061876813…03652757812197649039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.042 × 10⁹⁶(97-digit number)
20420441812123753626…07305515624395298079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.084 × 10⁹⁶(97-digit number)
40840883624247507252…14611031248790596159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.168 × 10⁹⁶(97-digit number)
81681767248495014504…29222062497581192319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.633 × 10⁹⁷(98-digit number)
16336353449699002900…58444124995162384639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.267 × 10⁹⁷(98-digit number)
32672706899398005801…16888249990324769279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.534 × 10⁹⁷(98-digit number)
65345413798796011603…33776499980649538559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.306 × 10⁹⁸(99-digit number)
13069082759759202320…67552999961299077119
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,777,842 XPM·at block #6,816,725 · 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