Block #3,310,728

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/14/2019, 1:15:44 PM · Difficulty 11.0337 · 3,500,296 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6cb36eebd9d5013d6f3291f2211effcba10589b231275442bd7a349b35e0520f

Height

#3,310,728

Difficulty

11.033723

Transactions

4

Size

879 B

Version

2

Bits

0b08a214

Nonce

862,468,136

Timestamp

8/14/2019, 1:15:44 PM

Confirmations

3,500,296

Merkle Root

5a0f73152a8cb916f08a641daa24e878d36d04b8c6a9b97b6447b759bd12847a
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.639 × 10⁹⁶(97-digit number)
16399831029508666309…86613006624650603519
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.639 × 10⁹⁶(97-digit number)
16399831029508666309…86613006624650603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.279 × 10⁹⁶(97-digit number)
32799662059017332619…73226013249301207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.559 × 10⁹⁶(97-digit number)
65599324118034665239…46452026498602414079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13119864823606933047…92904052997204828159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.623 × 10⁹⁷(98-digit number)
26239729647213866095…85808105994409656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.247 × 10⁹⁷(98-digit number)
52479459294427732191…71616211988819312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.049 × 10⁹⁸(99-digit number)
10495891858885546438…43232423977638625279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.099 × 10⁹⁸(99-digit number)
20991783717771092876…86464847955277250559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.198 × 10⁹⁸(99-digit number)
41983567435542185753…72929695910554501119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.396 × 10⁹⁸(99-digit number)
83967134871084371506…45859391821109002239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.679 × 10⁹⁹(100-digit number)
16793426974216874301…91718783642218004479
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,732,299 XPM·at block #6,811,023 · 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.

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