Block #3,061,362

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2019, 4:44:24 PM · Difficulty 11.0029 · 3,780,303 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f15c9df467027e0b2994f6dffd782db2758dbbad01b8a147a076f1a0e4cd862

Height

#3,061,362

Difficulty

11.002855

Transactions

13

Size

14.89 KB

Version

2

Bits

0b00bb15

Nonce

371,320,616

Timestamp

2/20/2019, 4:44:24 PM

Confirmations

3,780,303

Merkle Root

8022d33073f5904088fad91c6e1c6b628cb6f4847205316aa4166b6bb1035476
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.330 × 10⁹²(93-digit number)
53303830748500191914…48930609401056744139
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.330 × 10⁹²(93-digit number)
53303830748500191914…48930609401056744139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.066 × 10⁹³(94-digit number)
10660766149700038382…97861218802113488279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.132 × 10⁹³(94-digit number)
21321532299400076765…95722437604226976559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.264 × 10⁹³(94-digit number)
42643064598800153531…91444875208453953119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.528 × 10⁹³(94-digit number)
85286129197600307063…82889750416907906239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.705 × 10⁹⁴(95-digit number)
17057225839520061412…65779500833815812479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.411 × 10⁹⁴(95-digit number)
34114451679040122825…31559001667631624959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.822 × 10⁹⁴(95-digit number)
68228903358080245650…63118003335263249919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.364 × 10⁹⁵(96-digit number)
13645780671616049130…26236006670526499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.729 × 10⁹⁵(96-digit number)
27291561343232098260…52472013341052999679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.458 × 10⁹⁵(96-digit number)
54583122686464196520…04944026682105999359
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,977,709 XPM·at block #6,841,664 · 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