Block #319,088

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 7:21:17 PM · Difficulty 10.1641 · 6,496,053 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
794d9d4b7eb18e83c2ef6ee2341ca61352f388e00b97ca707d7834ec2ecd0f7e

Height

#319,088

Difficulty

10.164132

Transactions

15

Size

4.01 KB

Version

2

Bits

0a2a0496

Nonce

72,840

Timestamp

12/18/2013, 7:21:17 PM

Confirmations

6,496,053

Merkle Root

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

3.628 × 10⁹⁵(96-digit number)
36285416876331369273…32571322537308361999
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
3.628 × 10⁹⁵(96-digit number)
36285416876331369273…32571322537308361999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.257 × 10⁹⁵(96-digit number)
72570833752662738547…65142645074616723999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.451 × 10⁹⁶(97-digit number)
14514166750532547709…30285290149233447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.902 × 10⁹⁶(97-digit number)
29028333501065095419…60570580298466895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.805 × 10⁹⁶(97-digit number)
58056667002130190838…21141160596933791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.161 × 10⁹⁷(98-digit number)
11611333400426038167…42282321193867583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.322 × 10⁹⁷(98-digit number)
23222666800852076335…84564642387735167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.644 × 10⁹⁷(98-digit number)
46445333601704152670…69129284775470335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.289 × 10⁹⁷(98-digit number)
92890667203408305341…38258569550940671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.857 × 10⁹⁸(99-digit number)
18578133440681661068…76517139101881343999
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,765,222 XPM·at block #6,815,140 · 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