Block #2,730,131

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/1/2018, 9:32:24 PM · Difficulty 11.6298 · 4,114,308 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
619c78cac8d353c64c408287220254b6aef61f07ba72c32c74520818cf33abff

Height

#2,730,131

Difficulty

11.629780

Transactions

5

Size

17.58 KB

Version

2

Bits

0ba1393b

Nonce

2,063,807,515

Timestamp

7/1/2018, 9:32:24 PM

Confirmations

4,114,308

Merkle Root

609db028afab465d29a38a68e9a326ec26d7b67070f15b00cace4d22d8208701
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.892 × 10⁹³(94-digit number)
58928688368905117101…87788121593730563039
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.892 × 10⁹³(94-digit number)
58928688368905117101…87788121593730563039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.178 × 10⁹⁴(95-digit number)
11785737673781023420…75576243187461126079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.357 × 10⁹⁴(95-digit number)
23571475347562046840…51152486374922252159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.714 × 10⁹⁴(95-digit number)
47142950695124093681…02304972749844504319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.428 × 10⁹⁴(95-digit number)
94285901390248187362…04609945499689008639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.885 × 10⁹⁵(96-digit number)
18857180278049637472…09219890999378017279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.771 × 10⁹⁵(96-digit number)
37714360556099274944…18439781998756034559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.542 × 10⁹⁵(96-digit number)
75428721112198549889…36879563997512069119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.508 × 10⁹⁶(97-digit number)
15085744222439709977…73759127995024138239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.017 × 10⁹⁶(97-digit number)
30171488444879419955…47518255990048276479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.034 × 10⁹⁶(97-digit number)
60342976889758839911…95036511980096552959
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,999,908 XPM·at block #6,844,438 · 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