Block #3,055,631

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2019, 4:44:53 PM · Difficulty 11.0077 · 3,760,957 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
826e022f31ea95c5f8f84ec440bd09ada252641df889c19b6386810c741f2b4c

Height

#3,055,631

Difficulty

11.007677

Transactions

6

Size

2.37 KB

Version

2

Bits

0b01f71a

Nonce

327,368,617

Timestamp

2/16/2019, 4:44:53 PM

Confirmations

3,760,957

Merkle Root

0d9580acd07f56efc0d2a6688b6dbd96505245f263cc533b7efe916248bfcef6
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.

4.572 × 10⁹⁴(95-digit number)
45723343488133174916…10816565758324756319
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
4.572 × 10⁹⁴(95-digit number)
45723343488133174916…10816565758324756319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.144 × 10⁹⁴(95-digit number)
91446686976266349833…21633131516649512639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.828 × 10⁹⁵(96-digit number)
18289337395253269966…43266263033299025279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.657 × 10⁹⁵(96-digit number)
36578674790506539933…86532526066598050559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.315 × 10⁹⁵(96-digit number)
73157349581013079866…73065052133196101119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.463 × 10⁹⁶(97-digit number)
14631469916202615973…46130104266392202239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.926 × 10⁹⁶(97-digit number)
29262939832405231946…92260208532784404479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.852 × 10⁹⁶(97-digit number)
58525879664810463893…84520417065568808959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.170 × 10⁹⁷(98-digit number)
11705175932962092778…69040834131137617919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.341 × 10⁹⁷(98-digit number)
23410351865924185557…38081668262275235839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.682 × 10⁹⁷(98-digit number)
46820703731848371114…76163336524550471679
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,776,827 XPM·at block #6,816,587 · 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