glottologist

6

Imagine that each building had a lat-long position. Imagine you wanted to know the buildings that were closest to you and prove these are the buildings closest to you with a merkleized proof. How would you do that?

Answer

The best way, I think, to do this is to find an efficient tree representaion in regards to geospatial data like latitude and longitude that can be merkleized.

glottologist

{
    "overrides": [
        {
            "files": "*.sol",
            "options": {
                "printWidth": 80,
                "tabWidth": 4,
                "useTabs": false,
                "singleQuote": false,
                "bracketSpacing": false

glottologist

Lecture 1: Introduction to Research — [📝Lecture Notebooks] [▶️Video]
Lecture 2: Introduction to Python — [📝Lecture Notebooks] [▶️Video]
Lecture 3: Introduction to NumPy — [📝Lecture Notebooks] [▶️Video]
Lecture 4: Introduction to pandas — [📝Lecture Notebooks] [▶️Video]
Lecture 5: Plotting Data — [📝Lecture Notebooks] [[▶️Vide

glottologist

# Baseed on previous attempts of others: https://github.com/NixOS/nixpkgs/issues/41189
{ lib, vscode-utils, autoPatchelfHook, bash, file, makeWrapper, dotnet-sdk
, curl, gcc, icu, libkrb5, libsecret, libunwind, libX11, lttng-ust, openssl, utillinux, zlib
, enableDiagnosticsWorkaround ? false, gccStdenv
}:

with lib;

let
  # https://docs.microsoft.com/en-us/visualstudio/liveshare/reference/linux#install-prerequisites-manually

glottologist

Keybase proof

I hereby claim:

• I am glottologist on github.
• I am glottologist (https://keybase.io/glottologist) on keybase.
• I have a public key ASCI6uNhy-iDn8FhswXWcYUWnrikcBBA8M8I1wPGUZW5DQo

To claim this, I am signing this object: