Block #2,774,158

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/1/2018, 3:23:57 AM · Difficulty 11.6647 · 4,068,698 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b33a6b744c0b17332b54685a985a0854a3ac936eb9cf8c71d4b0873e265207ef

Height

#2,774,158

Difficulty

11.664662

Transactions

50

Size

11.50 KB

Version

2

Bits

0baa274a

Nonce

1,642,156,082

Timestamp

8/1/2018, 3:23:57 AM

Confirmations

4,068,698

Merkle Root

25a4dbc1b22286b4dd1079f1da0e181d89c76301919fcc486a5bc39abff6954b
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.

6.291 × 10⁹⁵(96-digit number)
62917531026793192371…08887042191918051839
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
6.291 × 10⁹⁵(96-digit number)
62917531026793192371…08887042191918051839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.258 × 10⁹⁶(97-digit number)
12583506205358638474…17774084383836103679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.516 × 10⁹⁶(97-digit number)
25167012410717276948…35548168767672207359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.033 × 10⁹⁶(97-digit number)
50334024821434553897…71096337535344414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.006 × 10⁹⁷(98-digit number)
10066804964286910779…42192675070688829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.013 × 10⁹⁷(98-digit number)
20133609928573821559…84385350141377658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.026 × 10⁹⁷(98-digit number)
40267219857147643118…68770700282755317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.053 × 10⁹⁷(98-digit number)
80534439714295286236…37541400565510635519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.610 × 10⁹⁸(99-digit number)
16106887942859057247…75082801131021271039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.221 × 10⁹⁸(99-digit number)
32213775885718114494…50165602262042542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.442 × 10⁹⁸(99-digit number)
64427551771436228988…00331204524085084159
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,987,195 XPM·at block #6,842,855 · 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