1. #6,832,0582CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #2,069,830

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/13/2017, 8:49:13 PM · Difficulty 10.8581 · 4,762,229 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e559a56abe06fbc1b1ff1d2a29bbe202d1a386eaafb1f6d2b1d98340e0242e18

Height

#2,069,830

Difficulty

10.858110

Transactions

2

Size

1.25 KB

Version

2

Bits

0adbad13

Nonce

120,939,418

Timestamp

4/13/2017, 8:49:13 PM

Confirmations

4,762,229

Merkle Root

3ed75e63422e6ffaa3f82543952b57ccbbe4102a056597d630d156596c01e171
Transactions (2)
1 in → 1 out8.4900 XPM110 B
7 in → 1 out9.9990 XPM1.05 KB
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.523 × 10⁹⁶(97-digit number)
15230595682219358316…44965081312105566719
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.523 × 10⁹⁶(97-digit number)
15230595682219358316…44965081312105566719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.046 × 10⁹⁶(97-digit number)
30461191364438716633…89930162624211133439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.092 × 10⁹⁶(97-digit number)
60922382728877433266…79860325248422266879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.218 × 10⁹⁷(98-digit number)
12184476545775486653…59720650496844533759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.436 × 10⁹⁷(98-digit number)
24368953091550973306…19441300993689067519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.873 × 10⁹⁷(98-digit number)
48737906183101946613…38882601987378135039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.747 × 10⁹⁷(98-digit number)
97475812366203893226…77765203974756270079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.949 × 10⁹⁸(99-digit number)
19495162473240778645…55530407949512540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.899 × 10⁹⁸(99-digit number)
38990324946481557290…11060815899025080319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.798 × 10⁹⁸(99-digit number)
77980649892963114581…22121631798050160639
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,900,604 XPM·at block #6,832,058 · 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