Block #2,819,805

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/1/2018, 10:31:29 AM · Difficulty 11.7024 · 4,006,867 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a64b854b0a3225dbef44f8829351532670b49071187e4e74bd3e1953ff3be0b9

Height

#2,819,805

Difficulty

11.702428

Transactions

6

Size

2.08 KB

Version

2

Bits

0bb3d25a

Nonce

104,809,813

Timestamp

9/1/2018, 10:31:29 AM

Confirmations

4,006,867

Merkle Root

cdb54ddeefd94498541b22730949ddda761f95fe2ed77a00f521d2ff5a56610f
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.759 × 10⁹⁴(95-digit number)
97595177012089910202…04397999870536380799
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.759 × 10⁹⁴(95-digit number)
97595177012089910202…04397999870536380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.951 × 10⁹⁵(96-digit number)
19519035402417982040…08795999741072761599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.903 × 10⁹⁵(96-digit number)
39038070804835964080…17591999482145523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.807 × 10⁹⁵(96-digit number)
78076141609671928161…35183998964291046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.561 × 10⁹⁶(97-digit number)
15615228321934385632…70367997928582092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.123 × 10⁹⁶(97-digit number)
31230456643868771264…40735995857164185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.246 × 10⁹⁶(97-digit number)
62460913287737542529…81471991714328371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.249 × 10⁹⁷(98-digit number)
12492182657547508505…62943983428656742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.498 × 10⁹⁷(98-digit number)
24984365315095017011…25887966857313484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.996 × 10⁹⁷(98-digit number)
49968730630190034023…51775933714626969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.993 × 10⁹⁷(98-digit number)
99937461260380068046…03551867429253939199
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,857,524 XPM·at block #6,826,671 · 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