Block #1,532,638

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2016, 12:43:39 AM · Difficulty 10.6136 · 5,283,954 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8d61c7ee5e8a8de5bdce133c53bca0809c79a16d8d3f52e9011e8807e181547a

Height

#1,532,638

Difficulty

10.613637

Transactions

2

Size

1.71 KB

Version

2

Bits

0a9d174d

Nonce

165,523,595

Timestamp

4/9/2016, 12:43:39 AM

Confirmations

5,283,954

Merkle Root

c4a12864c8c92e724ea88e5b388aec73ee340c4e331fe49e8a726baa3eed25d6
Transactions (2)
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.

1.041 × 10⁹²(93-digit number)
10415762221583235619…37809929974552934609
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
1.041 × 10⁹²(93-digit number)
10415762221583235619…37809929974552934609
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.083 × 10⁹²(93-digit number)
20831524443166471239…75619859949105869219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.166 × 10⁹²(93-digit number)
41663048886332942479…51239719898211738439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.332 × 10⁹²(93-digit number)
83326097772665884958…02479439796423476879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.666 × 10⁹³(94-digit number)
16665219554533176991…04958879592846953759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.333 × 10⁹³(94-digit number)
33330439109066353983…09917759185693907519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.666 × 10⁹³(94-digit number)
66660878218132707966…19835518371387815039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.333 × 10⁹⁴(95-digit number)
13332175643626541593…39671036742775630079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.666 × 10⁹⁴(95-digit number)
26664351287253083186…79342073485551260159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.332 × 10⁹⁴(95-digit number)
53328702574506166373…58684146971102520319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.066 × 10⁹⁵(96-digit number)
10665740514901233274…17368293942205040639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,776,860 XPM·at block #6,816,591 · 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