Block #328,842

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/25/2013, 1:41:02 PM · Difficulty 10.1687 · 6,489,040 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e217deb1a4a10fb663361c256a28ee4dadbcc2053b08bb495cf6ebfd9e98ffa9

Height

#328,842

Difficulty

10.168684

Transactions

6

Size

2.31 KB

Version

2

Bits

0a2b2ed9

Nonce

15,531

Timestamp

12/25/2013, 1:41:02 PM

Confirmations

6,489,040

Merkle Root

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

9.189 × 10⁹⁶(97-digit number)
91895695676543574691…24973697396907501279
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
9.189 × 10⁹⁶(97-digit number)
91895695676543574691…24973697396907501279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.837 × 10⁹⁷(98-digit number)
18379139135308714938…49947394793815002559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.675 × 10⁹⁷(98-digit number)
36758278270617429876…99894789587630005119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.351 × 10⁹⁷(98-digit number)
73516556541234859753…99789579175260010239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.470 × 10⁹⁸(99-digit number)
14703311308246971950…99579158350520020479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.940 × 10⁹⁸(99-digit number)
29406622616493943901…99158316701040040959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.881 × 10⁹⁸(99-digit number)
58813245232987887802…98316633402080081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.176 × 10⁹⁹(100-digit number)
11762649046597577560…96633266804160163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.352 × 10⁹⁹(100-digit number)
23525298093195155121…93266533608320327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.705 × 10⁹⁹(100-digit number)
47050596186390310242…86533067216640655359
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,787,116 XPM·at block #6,817,881 · 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