Block #3,085,461

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2019, 1:42:03 PM · Difficulty 11.0308 · 3,753,672 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3d8c1da8d304211318f92e982a59565c831c3901f5238ec7ac84059b7481c3cf

Height

#3,085,461

Difficulty

11.030809

Transactions

4

Size

1.00 KB

Version

2

Bits

0b07e31c

Nonce

1,287,499,810

Timestamp

3/9/2019, 1:42:03 PM

Confirmations

3,753,672

Merkle Root

b1692f19320871d4904eb8dac8524cf2b0838e6a57a623eae0a4d9843c3bb92c
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.328 × 10⁹³(94-digit number)
13283236520130596727…36730628782672451839
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.328 × 10⁹³(94-digit number)
13283236520130596727…36730628782672451839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.656 × 10⁹³(94-digit number)
26566473040261193455…73461257565344903679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.313 × 10⁹³(94-digit number)
53132946080522386910…46922515130689807359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.062 × 10⁹⁴(95-digit number)
10626589216104477382…93845030261379614719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.125 × 10⁹⁴(95-digit number)
21253178432208954764…87690060522759229439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.250 × 10⁹⁴(95-digit number)
42506356864417909528…75380121045518458879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.501 × 10⁹⁴(95-digit number)
85012713728835819056…50760242091036917759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.700 × 10⁹⁵(96-digit number)
17002542745767163811…01520484182073835519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.400 × 10⁹⁵(96-digit number)
34005085491534327622…03040968364147671039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.801 × 10⁹⁵(96-digit number)
68010170983068655245…06081936728295342079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.360 × 10⁹⁶(97-digit number)
13602034196613731049…12163873456590684159
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,957,342 XPM·at block #6,839,132 · 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