Block #3,290,806

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/1/2019, 1:30:56 PM · Difficulty 10.9948 · 3,519,938 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3765a0c28ffaf0d9586d97419a84b762448df8dfee4f1140431ebffe07ae0b45

Height

#3,290,806

Difficulty

10.994755

Transactions

9

Size

1.70 KB

Version

2

Bits

0afea83e

Nonce

592,188,876

Timestamp

8/1/2019, 1:30:56 PM

Confirmations

3,519,938

Merkle Root

658e6ebbd71e79d8bf7a7c8399174003eacb237551fb2d252c8533736e66df7e
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.572 × 10⁹⁴(95-digit number)
15727475632661969551…57088668166724324479
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.572 × 10⁹⁴(95-digit number)
15727475632661969551…57088668166724324479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.145 × 10⁹⁴(95-digit number)
31454951265323939103…14177336333448648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.290 × 10⁹⁴(95-digit number)
62909902530647878207…28354672666897297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.258 × 10⁹⁵(96-digit number)
12581980506129575641…56709345333794595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.516 × 10⁹⁵(96-digit number)
25163961012259151283…13418690667589191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.032 × 10⁹⁵(96-digit number)
50327922024518302566…26837381335178383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.006 × 10⁹⁶(97-digit number)
10065584404903660513…53674762670356766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.013 × 10⁹⁶(97-digit number)
20131168809807321026…07349525340713533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.026 × 10⁹⁶(97-digit number)
40262337619614642052…14699050681427066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.052 × 10⁹⁶(97-digit number)
80524675239229284105…29398101362854133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.610 × 10⁹⁷(98-digit number)
16104935047845856821…58796202725708267519
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,730,044 XPM·at block #6,810,743 · 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.

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