Block #2,343,623

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/20/2017, 2:46:14 AM · Difficulty 10.9025 · 4,498,712 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
37b87b04d0dc527fee0853d2f4155922125538dec72605681743f2f8f2f0b67e

Height

#2,343,623

Difficulty

10.902504

Transactions

6

Size

3.80 KB

Version

2

Bits

0ae70a86

Nonce

1,294,504,790

Timestamp

10/20/2017, 2:46:14 AM

Confirmations

4,498,712

Merkle Root

a4236fdafd59f9a72220f15c39a6d45cff3a3f949822e94bb07bdbdc05575580
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.

9.464 × 10⁹³(94-digit number)
94645979795290016972…11338229448205341139
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
9.464 × 10⁹³(94-digit number)
94645979795290016972…11338229448205341139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.892 × 10⁹⁴(95-digit number)
18929195959058003394…22676458896410682279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.785 × 10⁹⁴(95-digit number)
37858391918116006789…45352917792821364559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.571 × 10⁹⁴(95-digit number)
75716783836232013578…90705835585642729119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.514 × 10⁹⁵(96-digit number)
15143356767246402715…81411671171285458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.028 × 10⁹⁵(96-digit number)
30286713534492805431…62823342342570916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.057 × 10⁹⁵(96-digit number)
60573427068985610862…25646684685141832959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.211 × 10⁹⁶(97-digit number)
12114685413797122172…51293369370283665919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.422 × 10⁹⁶(97-digit number)
24229370827594244344…02586738740567331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.845 × 10⁹⁶(97-digit number)
48458741655188488689…05173477481134663679
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,983,086 XPM·at block #6,842,334 · 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