Block #1,532,591

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2016, 12:04:26 AM · Difficulty 10.6132 · 5,284,540 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
80d8ba2b8a5a392b2df02f135f3d7f0e9db421ce71e7179c67ee8b82f6fc76e3

Height

#1,532,591

Difficulty

10.613176

Transactions

2

Size

934 B

Version

2

Bits

0a9cf91a

Nonce

1,318,745,195

Timestamp

4/9/2016, 12:04:26 AM

Confirmations

5,284,540

Merkle Root

8385489bd6fce5278a9a03a2ecf63496237b930ae67bd9c6af7b6a85fb06f6c9
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.

6.491 × 10⁹⁴(95-digit number)
64918259837597142805…81627901829070558079
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
6.491 × 10⁹⁴(95-digit number)
64918259837597142805…81627901829070558079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.298 × 10⁹⁵(96-digit number)
12983651967519428561…63255803658141116159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.596 × 10⁹⁵(96-digit number)
25967303935038857122…26511607316282232319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.193 × 10⁹⁵(96-digit number)
51934607870077714244…53023214632564464639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.038 × 10⁹⁶(97-digit number)
10386921574015542848…06046429265128929279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.077 × 10⁹⁶(97-digit number)
20773843148031085697…12092858530257858559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.154 × 10⁹⁶(97-digit number)
41547686296062171395…24185717060515717119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.309 × 10⁹⁶(97-digit number)
83095372592124342791…48371434121031434239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.661 × 10⁹⁷(98-digit number)
16619074518424868558…96742868242062868479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.323 × 10⁹⁷(98-digit number)
33238149036849737116…93485736484125736959
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,781,082 XPM·at block #6,817,130 · 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