Block #2,832,915

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/10/2018, 9:28:26 AM · Difficulty 11.7151 · 4,005,762 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0bbc48c5306aa3a6cc3c44ae3e671d9a49ba63bb0149d6e5e63b22391b83774b

Height

#2,832,915

Difficulty

11.715125

Transactions

3

Size

584 B

Version

2

Bits

0bb71268

Nonce

718,666,965

Timestamp

9/10/2018, 9:28:26 AM

Confirmations

4,005,762

Merkle Root

2e01a6ad9ad1360fb7b9df39da7e7619e29079ed2d8d579b83aa851407a069aa
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.254 × 10⁹⁵(96-digit number)
42544392383190976405…29062781280396342399
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.254 × 10⁹⁵(96-digit number)
42544392383190976405…29062781280396342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.508 × 10⁹⁵(96-digit number)
85088784766381952811…58125562560792684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.701 × 10⁹⁶(97-digit number)
17017756953276390562…16251125121585369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.403 × 10⁹⁶(97-digit number)
34035513906552781124…32502250243170739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.807 × 10⁹⁶(97-digit number)
68071027813105562249…65004500486341478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.361 × 10⁹⁷(98-digit number)
13614205562621112449…30009000972682956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.722 × 10⁹⁷(98-digit number)
27228411125242224899…60018001945365913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.445 × 10⁹⁷(98-digit number)
54456822250484449799…20036003890731827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.089 × 10⁹⁸(99-digit number)
10891364450096889959…40072007781463654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.178 × 10⁹⁸(99-digit number)
21782728900193779919…80144015562927308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.356 × 10⁹⁸(99-digit number)
43565457800387559839…60288031125854617599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,953,677 XPM·at block #6,838,676 · 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