Block #3,005,663

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2019, 12:39:00 AM · Difficulty 11.1992 · 3,833,647 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
498d63133f28ba028e42b842fe47d1545a7912e21757e1ae45c4ec7d1e383f03

Height

#3,005,663

Difficulty

11.199246

Transactions

3

Size

1.27 KB

Version

2

Bits

0b3301d1

Nonce

693,369,170

Timestamp

1/12/2019, 12:39:00 AM

Confirmations

3,833,647

Merkle Root

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

5.981 × 10⁹³(94-digit number)
59814358874015327642…79930239697456466639
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
5.981 × 10⁹³(94-digit number)
59814358874015327642…79930239697456466639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.196 × 10⁹⁴(95-digit number)
11962871774803065528…59860479394912933279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.392 × 10⁹⁴(95-digit number)
23925743549606131056…19720958789825866559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.785 × 10⁹⁴(95-digit number)
47851487099212262113…39441917579651733119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.570 × 10⁹⁴(95-digit number)
95702974198424524227…78883835159303466239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.914 × 10⁹⁵(96-digit number)
19140594839684904845…57767670318606932479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.828 × 10⁹⁵(96-digit number)
38281189679369809691…15535340637213864959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.656 × 10⁹⁵(96-digit number)
76562379358739619382…31070681274427729919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.531 × 10⁹⁶(97-digit number)
15312475871747923876…62141362548855459839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.062 × 10⁹⁶(97-digit number)
30624951743495847752…24282725097710919679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.124 × 10⁹⁶(97-digit number)
61249903486991695505…48565450195421839359
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,958,760 XPM·at block #6,839,309 · 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