Block #319,307

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 10:37:52 PM · Difficulty 10.1676 · 6,506,005 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9d3ec656d5978806c9eb836b5b5788bd6fa8f7acb103d1cf422d9a392ddb3917

Height

#319,307

Difficulty

10.167603

Transactions

8

Size

3.83 KB

Version

2

Bits

0a2ae806

Nonce

81,587

Timestamp

12/18/2013, 10:37:52 PM

Confirmations

6,506,005

Merkle Root

b0ca1a8a36e2b16fa3b018017020e78a3fef83c009c5416ac148214fbae2e09b
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.444 × 10⁹⁴(95-digit number)
44448519138044494365…66946754773412180479
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.444 × 10⁹⁴(95-digit number)
44448519138044494365…66946754773412180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.889 × 10⁹⁴(95-digit number)
88897038276088988730…33893509546824360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.777 × 10⁹⁵(96-digit number)
17779407655217797746…67787019093648721919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.555 × 10⁹⁵(96-digit number)
35558815310435595492…35574038187297443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.111 × 10⁹⁵(96-digit number)
71117630620871190984…71148076374594887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.422 × 10⁹⁶(97-digit number)
14223526124174238196…42296152749189775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.844 × 10⁹⁶(97-digit number)
28447052248348476393…84592305498379550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.689 × 10⁹⁶(97-digit number)
56894104496696952787…69184610996759101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.137 × 10⁹⁷(98-digit number)
11378820899339390557…38369221993518202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.275 × 10⁹⁷(98-digit number)
22757641798678781114…76738443987036405759
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,599 XPM·at block #6,825,311 · 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