Block #3,067,461

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2019, 12:58:00 AM · Difficulty 11.0013 · 3,774,249 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
80d56f8fb9e54b1685e9e6cb4bcb3d41d2707d9d815884d521da0bddaca00fbe

Height

#3,067,461

Difficulty

11.001331

Transactions

2

Size

723 B

Version

2

Bits

0b005742

Nonce

1,133,970,536

Timestamp

2/25/2019, 12:58:00 AM

Confirmations

3,774,249

Merkle Root

67e44368f3cf828397edca3cef46e833ba1ca26681706d4524e3e327108c0a69
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.215 × 10⁹⁶(97-digit number)
12153499380991852717…21820679249572762559
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.215 × 10⁹⁶(97-digit number)
12153499380991852717…21820679249572762559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.430 × 10⁹⁶(97-digit number)
24306998761983705435…43641358499145525119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.861 × 10⁹⁶(97-digit number)
48613997523967410870…87282716998291050239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.722 × 10⁹⁶(97-digit number)
97227995047934821741…74565433996582100479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.944 × 10⁹⁷(98-digit number)
19445599009586964348…49130867993164200959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.889 × 10⁹⁷(98-digit number)
38891198019173928696…98261735986328401919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.778 × 10⁹⁷(98-digit number)
77782396038347857393…96523471972656803839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.555 × 10⁹⁸(99-digit number)
15556479207669571478…93046943945313607679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.111 × 10⁹⁸(99-digit number)
31112958415339142957…86093887890627215359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.222 × 10⁹⁸(99-digit number)
62225916830678285914…72187775781254430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.244 × 10⁹⁹(100-digit number)
12445183366135657182…44375551562508861439
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,978,059 XPM·at block #6,841,709 · 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