Block #3,228,288

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2019, 9:00:34 PM · Difficulty 11.0053 · 3,604,285 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b9d100474604bb4d734ffb60c77f21a12724ccc03828d0749a4549c82b2ee501

Height

#3,228,288

Difficulty

11.005260

Transactions

22

Size

4.66 KB

Version

2

Bits

0b0158bb

Nonce

547,669,735

Timestamp

6/16/2019, 9:00:34 PM

Confirmations

3,604,285

Merkle Root

e5c6f18ce1bc117057a0cdafca185f4e5a06f91dba42ac71040a5556c7582d25
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.465 × 10⁹²(93-digit number)
14658535614912265698…47129157574654945279
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.465 × 10⁹²(93-digit number)
14658535614912265698…47129157574654945279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.931 × 10⁹²(93-digit number)
29317071229824531397…94258315149309890559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.863 × 10⁹²(93-digit number)
58634142459649062795…88516630298619781119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.172 × 10⁹³(94-digit number)
11726828491929812559…77033260597239562239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.345 × 10⁹³(94-digit number)
23453656983859625118…54066521194479124479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.690 × 10⁹³(94-digit number)
46907313967719250236…08133042388958248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.381 × 10⁹³(94-digit number)
93814627935438500472…16266084777916497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.876 × 10⁹⁴(95-digit number)
18762925587087700094…32532169555832995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.752 × 10⁹⁴(95-digit number)
37525851174175400188…65064339111665991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.505 × 10⁹⁴(95-digit number)
75051702348350800377…30128678223331983359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.501 × 10⁹⁵(96-digit number)
15010340469670160075…60257356446663966719
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,904,743 XPM·at block #6,832,572 · 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