Block #2,261,834

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/21/2017, 4:35:40 PM · Difficulty 10.9520 · 4,582,166 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
738d39a24b1fd0c4d54a17da280879f73301e6cde517c8d02f2c9f8193bd0d95

Height

#2,261,834

Difficulty

10.952008

Transactions

2

Size

1.28 KB

Version

2

Bits

0af3b6c4

Nonce

3,913,085

Timestamp

8/21/2017, 4:35:40 PM

Confirmations

4,582,166

Merkle Root

6bf4a3fa6d4ade1a07a76de0e4732cbefe661389e3178a2469c866dbab40da9d
Transactions (2)
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.058 × 10⁹⁴(95-digit number)
40583159297020114326…62153927951482755199
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.058 × 10⁹⁴(95-digit number)
40583159297020114326…62153927951482755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.116 × 10⁹⁴(95-digit number)
81166318594040228653…24307855902965510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.623 × 10⁹⁵(96-digit number)
16233263718808045730…48615711805931020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.246 × 10⁹⁵(96-digit number)
32466527437616091461…97231423611862041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.493 × 10⁹⁵(96-digit number)
64933054875232182922…94462847223724083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.298 × 10⁹⁶(97-digit number)
12986610975046436584…88925694447448166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.597 × 10⁹⁶(97-digit number)
25973221950092873169…77851388894896332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.194 × 10⁹⁶(97-digit number)
51946443900185746338…55702777789792665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.038 × 10⁹⁷(98-digit number)
10389288780037149267…11405555579585331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.077 × 10⁹⁷(98-digit number)
20778577560074298535…22811111159170662399
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,996,382 XPM·at block #6,843,999 · 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