Block #1,771,605

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/20/2016, 2:45:06 PM · Difficulty 10.7461 · 5,071,225 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2377f541576eda872a7b8a9bd7d2a2702dab1c3b12dbb18e5432bfb0d4dd85c0

Height

#1,771,605

Difficulty

10.746051

Transactions

2

Size

1.14 KB

Version

2

Bits

0abefd3b

Nonce

254,875,466

Timestamp

9/20/2016, 2:45:06 PM

Confirmations

5,071,225

Merkle Root

757c2cbd597bc6534c9ffd042b3faed140e0edc2270e38045f92ecba148fca75
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.

1.997 × 10⁹⁵(96-digit number)
19971408734479523772…75747107997778821119
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.997 × 10⁹⁵(96-digit number)
19971408734479523772…75747107997778821119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.994 × 10⁹⁵(96-digit number)
39942817468959047544…51494215995557642239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.988 × 10⁹⁵(96-digit number)
79885634937918095089…02988431991115284479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.597 × 10⁹⁶(97-digit number)
15977126987583619017…05976863982230568959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.195 × 10⁹⁶(97-digit number)
31954253975167238035…11953727964461137919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.390 × 10⁹⁶(97-digit number)
63908507950334476071…23907455928922275839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.278 × 10⁹⁷(98-digit number)
12781701590066895214…47814911857844551679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.556 × 10⁹⁷(98-digit number)
25563403180133790428…95629823715689103359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.112 × 10⁹⁷(98-digit number)
51126806360267580857…91259647431378206719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.022 × 10⁹⁸(99-digit number)
10225361272053516171…82519294862756413439
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,986,983 XPM·at block #6,842,829 · 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