Block #2,035,883

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2017, 2:27:12 AM · Difficulty 10.6798 · 4,780,446 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4971794c2b56ad295d987323365d20ab082ee2c6bbaa9b9e0b86edbd533117d9

Height

#2,035,883

Difficulty

10.679806

Transactions

3

Size

5.69 KB

Version

2

Bits

0aae07c5

Nonce

1,379,421,305

Timestamp

3/24/2017, 2:27:12 AM

Confirmations

4,780,446

Merkle Root

cf04b32242f159917fa6f059d5f20def5a8977ce3a9fb75a84f8a8907dd14716
Transactions (3)
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.

3.670 × 10⁹⁴(95-digit number)
36709427208370338527…15631353137306431999
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
3.670 × 10⁹⁴(95-digit number)
36709427208370338527…15631353137306431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.341 × 10⁹⁴(95-digit number)
73418854416740677054…31262706274612863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.468 × 10⁹⁵(96-digit number)
14683770883348135410…62525412549225727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.936 × 10⁹⁵(96-digit number)
29367541766696270821…25050825098451455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.873 × 10⁹⁵(96-digit number)
58735083533392541643…50101650196902911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.174 × 10⁹⁶(97-digit number)
11747016706678508328…00203300393805823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.349 × 10⁹⁶(97-digit number)
23494033413357016657…00406600787611647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.698 × 10⁹⁶(97-digit number)
46988066826714033314…00813201575223295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.397 × 10⁹⁶(97-digit number)
93976133653428066629…01626403150446591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.879 × 10⁹⁷(98-digit number)
18795226730685613325…03252806300893183999
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,774,753 XPM·at block #6,816,328 · 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