Deploying to gh-pages from @ status-im/network-stories@7b44a9d148 🚀

This commit is contained in:
Corey 2022-04-13 16:19:53 +00:00
parent ae3ca2ae4f
commit d8eab2f22f
653 changed files with 28 additions and 220518 deletions

350
.gitignore vendored
View File

@ -1,350 +0,0 @@
## Ignore Visual Studio temporary files, build results, and
## files generated by popular Visual Studio add-ons.
##
## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore
# User-specific files
*.rsuser
*.suo
*.user
*.userosscache
*.sln.docstates
# User-specific files (MonoDevelop/Xamarin Studio)
*.userprefs
# Mono auto generated files
mono_crash.*
# Build results
[Dd]ebug/
[Dd]ebugPublic/
[Rr]elease/
[Rr]eleases/
x64/
x86/
[Aa][Rr][Mm]/
[Aa][Rr][Mm]64/
bld/
[Bb]in/
[Oo]bj/
[Ll]og/
[Ll]ogs/
# Visual Studio 2015/2017 cache/options directory
.vs/
# Uncomment if you have tasks that create the project's static files in wwwroot
#wwwroot/
# Visual Studio 2017 auto generated files
Generated\ Files/
# MSTest test Results
[Tt]est[Rr]esult*/
[Bb]uild[Ll]og.*
# NUnit
*.VisualState.xml
TestResult.xml
nunit-*.xml
# Build Results of an ATL Project
[Dd]ebugPS/
[Rr]eleasePS/
dlldata.c
# Benchmark Results
BenchmarkDotNet.Artifacts/
# .NET Core
project.lock.json
project.fragment.lock.json
artifacts/
# StyleCop
StyleCopReport.xml
# Files built by Visual Studio
*_i.c
*_p.c
*_h.h
*.ilk
*.meta
*.obj
*.iobj
*.pch
*.pdb
*.ipdb
*.pgc
*.pgd
*.rsp
*.sbr
*.tlb
*.tli
*.tlh
*.tmp
*.tmp_proj
*_wpftmp.csproj
*.log
*.vspscc
*.vssscc
.builds
*.pidb
*.svclog
*.scc
# Chutzpah Test files
_Chutzpah*
# Visual C++ cache files
ipch/
*.aps
*.ncb
*.opendb
*.opensdf
*.sdf
*.cachefile
*.VC.db
*.VC.VC.opendb
# Visual Studio profiler
*.psess
*.vsp
*.vspx
*.sap
# Visual Studio Trace Files
*.e2e
# TFS 2012 Local Workspace
$tf/
# Guidance Automation Toolkit
*.gpState
# ReSharper is a .NET coding add-in
_ReSharper*/
*.[Rr]e[Ss]harper
*.DotSettings.user
# TeamCity is a build add-in
_TeamCity*
# DotCover is a Code Coverage Tool
*.dotCover
# AxoCover is a Code Coverage Tool
.axoCover/*
!.axoCover/settings.json
# Visual Studio code coverage results
*.coverage
*.coveragexml
# NCrunch
_NCrunch_*
.*crunch*.local.xml
nCrunchTemp_*
# MightyMoose
*.mm.*
AutoTest.Net/
# Web workbench (sass)
.sass-cache/
# Installshield output folder
[Ee]xpress/
# DocProject is a documentation generator add-in
DocProject/buildhelp/
DocProject/Help/*.HxT
DocProject/Help/*.HxC
DocProject/Help/*.hhc
DocProject/Help/*.hhk
DocProject/Help/*.hhp
DocProject/Help/Html2
DocProject/Help/html
# Click-Once directory
publish/
# Publish Web Output
*.[Pp]ublish.xml
*.azurePubxml
# Note: Comment the next line if you want to checkin your web deploy settings,
# but database connection strings (with potential passwords) will be unencrypted
*.pubxml
*.publishproj
# Microsoft Azure Web App publish settings. Comment the next line if you want to
# checkin your Azure Web App publish settings, but sensitive information contained
# in these scripts will be unencrypted
PublishScripts/
# NuGet Packages
*.nupkg
# NuGet Symbol Packages
*.snupkg
# The packages folder can be ignored because of Package Restore
**/[Pp]ackages/*
# except build/, which is used as an MSBuild target.
!**/[Pp]ackages/build/
# Uncomment if necessary however generally it will be regenerated when needed
#!**/[Pp]ackages/repositories.config
# NuGet v3's project.json files produces more ignorable files
*.nuget.props
*.nuget.targets
# Microsoft Azure Build Output
csx/
*.build.csdef
# Microsoft Azure Emulator
ecf/
rcf/
# Windows Store app package directories and files
AppPackages/
BundleArtifacts/
Package.StoreAssociation.xml
_pkginfo.txt
*.appx
*.appxbundle
*.appxupload
# Visual Studio cache files
# files ending in .cache can be ignored
*.[Cc]ache
# but keep track of directories ending in .cache
!?*.[Cc]ache/
# Others
ClientBin/
~$*
*~
*.dbmdl
*.dbproj.schemaview
*.jfm
*.pfx
*.publishsettings
orleans.codegen.cs
# Including strong name files can present a security risk
# (https://github.com/github/gitignore/pull/2483#issue-259490424)
#*.snk
# Since there are multiple workflows, uncomment next line to ignore bower_components
# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)
#bower_components/
# RIA/Silverlight projects
Generated_Code/
# Backup & report files from converting an old project file
# to a newer Visual Studio version. Backup files are not needed,
# because we have git ;-)
_UpgradeReport_Files/
Backup*/
UpgradeLog*.XML
UpgradeLog*.htm
ServiceFabricBackup/
*.rptproj.bak
# SQL Server files
*.mdf
*.ldf
*.ndf
# Business Intelligence projects
*.rdl.data
*.bim.layout
*.bim_*.settings
*.rptproj.rsuser
*- [Bb]ackup.rdl
*- [Bb]ackup ([0-9]).rdl
*- [Bb]ackup ([0-9][0-9]).rdl
# Microsoft Fakes
FakesAssemblies/
# GhostDoc plugin setting file
*.GhostDoc.xml
# Node.js Tools for Visual Studio
.ntvs_analysis.dat
node_modules/
# Visual Studio 6 build log
*.plg
# Visual Studio 6 workspace options file
*.opt
# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)
*.vbw
# Visual Studio LightSwitch build output
**/*.HTMLClient/GeneratedArtifacts
**/*.DesktopClient/GeneratedArtifacts
**/*.DesktopClient/ModelManifest.xml
**/*.Server/GeneratedArtifacts
**/*.Server/ModelManifest.xml
_Pvt_Extensions
# Paket dependency manager
.paket/paket.exe
paket-files/
# FAKE - F# Make
.fake/
# CodeRush personal settings
.cr/personal
# Python Tools for Visual Studio (PTVS)
__pycache__/
*.pyc
# Cake - Uncomment if you are using it
# tools/**
# !tools/packages.config
# Tabs Studio
*.tss
# Telerik's JustMock configuration file
*.jmconfig
# BizTalk build output
*.btp.cs
*.btm.cs
*.odx.cs
*.xsd.cs
# OpenCover UI analysis results
OpenCover/
# Azure Stream Analytics local run output
ASALocalRun/
# MSBuild Binary and Structured Log
*.binlog
# NVidia Nsight GPU debugger configuration file
*.nvuser
# MFractors (Xamarin productivity tool) working folder
.mfractor/
# Local History for Visual Studio
.localhistory/
# BeatPulse healthcheck temp database
healthchecksdb
# Backup folder for Package Reference Convert tool in Visual Studio 2017
MigrationBackup/
# Ionide (cross platform F# VS Code tools) working folder
.ionide/

4
.obsidian/app.json vendored
View File

@ -1,4 +0,0 @@
{
"legacyEditor": false,
"livePreview": true
}

View File

@ -1 +0,0 @@
{}

View File

@ -1,15 +0,0 @@
[
"file-explorer",
"global-search",
"switcher",
"graph",
"backlink",
"page-preview",
"note-composer",
"command-palette",
"editor-status",
"markdown-importer",
"word-count",
"open-with-default-app",
"file-recovery"
]

View File

@ -1 +0,0 @@
{}

114
.obsidian/workspace vendored
View File

@ -1,114 +0,0 @@
{
"main": {
"id": "1372a18cf7c47699",
"type": "split",
"children": [
{
"id": "a4e3ed3adec56c10",
"type": "leaf",
"dimension": 52.28031145717463,
"state": {
"type": "markdown",
"state": {
"file": "pages/Helper Document.md",
"mode": "source",
"source": false
}
},
"group": "768ec003cffa6b11"
},
{
"id": "17af015f03c3fa79",
"type": "leaf",
"dimension": 47.71968854282537,
"state": {
"type": "markdown",
"state": {
"file": "pages/Helper Document.md",
"mode": "preview",
"source": false
}
},
"group": "768ec003cffa6b11"
}
],
"direction": "vertical"
},
"left": {
"id": "537a239ad3175cee",
"type": "split",
"children": [
{
"id": "767d8d667cca2d36",
"type": "tabs",
"children": [
{
"id": "efd011a01ac980ab",
"type": "leaf",
"state": {
"type": "file-explorer",
"state": {}
}
},
{
"id": "20c7fc8666821583",
"type": "leaf",
"state": {
"type": "search",
"state": {
"query": "",
"matchingCase": false,
"explainSearch": false,
"collapseAll": false,
"extraContext": false,
"sortOrder": "alphabetical"
}
}
}
]
}
],
"direction": "horizontal",
"width": 300
},
"right": {
"id": "5a82e9ac98b3e694",
"type": "split",
"children": [
{
"id": "4d749ed0f82a6131",
"type": "tabs",
"children": [
{
"id": "2e72fdc824c3a394",
"type": "leaf",
"state": {
"type": "backlink",
"state": {
"file": "pages/Helper Document.md",
"collapseAll": false,
"extraContext": false,
"sortOrder": "alphabetical",
"showSearch": false,
"searchQuery": "",
"backlinkCollapsed": false,
"unlinkedCollapsed": true
}
}
}
]
}
],
"direction": "horizontal",
"width": 300,
"collapsed": true
},
"active": "a4e3ed3adec56c10",
"lastOpenFiles": [
"pages/Helper Document.md",
"pages/here.md",
"pages/BBA.md",
"pages/Bootstrapping Quickly.md",
"pages/A day in the life of Jane.md"
]
}

21
LICENSE
View File

@ -1,21 +0,0 @@
MIT License
Copyright (c) 2021 Status
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

View File

@ -1,2 +0,0 @@
# network-stories
End User stories of the "Status Network"

File diff suppressed because one or more lines are too long

File diff suppressed because it is too large Load Diff

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

Binary file not shown.

Binary file not shown.

Binary file not shown.

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

View File

@ -1,2 +0,0 @@
!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):e.MagicPortal=t()}(this,function(){var e=function(e){var t=this;this.rpc_counter=0,this.channel=e,this.foreign=new Map,this.local=new Map,this.calls=new Map,this.queue=[],this.connectionEstablished=!1,this.channel.addEventListener("message",function(e){var n=e.data;if(n&&"object"==typeof n)switch(n.type){case"MP_INIT":return t.onInit(n);case"MP_SET":return t.onSet(n);case"MP_CALL":return t.onCall(n);case"MP_RETURN":return t.onReturn(n)}}),this.channel.postMessage({type:"MP_INIT",id:1,reply:!0})};e.prototype.onInit=function(e){this.connectionEstablished=!0;var t=this.queue;this.queue=[];for(var n=0,o=t;n<o.length;n+=1){this.channel.postMessage(o[n])}e.reply&&this.channel.postMessage({type:"MP_INIT",reply:!1})},e.prototype.onSet=function(e){for(var t=this,n={},o=e.object,i=function(){var i=r[s],c=!e.void.includes(i);n[i]=function(){for(var e=[],n=arguments.length;n--;)e[n]=arguments[n];return t.rpc_counter=(t.rpc_counter+1)%Number.MAX_SAFE_INTEGER,new Promise(function(n,s){t.postMessage({type:"MP_CALL",object:o,method:i,id:t.rpc_counter,args:e,reply:c}),c?t.calls.set(t.rpc_counter,{resolve:n,reject:s}):n()})}},s=0,r=e.methods;s<r.length;s+=1)i();var c=this.foreign.get(e.object);this.foreign.set(e.object,n),"function"==typeof c&&c(n)},e.prototype.onCall=function(e){var t=this,n=this.local.get(e.object);n&&n[e.method].apply(n,e.args).then(function(n){return e.reply&&t.channel.postMessage({type:"MP_RETURN",id:e.id,result:n})}).catch(function(n){return t.channel.postMessage({type:"MP_RETURN",id:e.id,error:n.message})})},e.prototype.onReturn=function(e){if(this.calls.has(e.id)){var t=this.calls.get(e.id),n=t.resolve,o=t.reject;this.calls.delete(e.id),e.error?o(e.error):n(e.result)}},e.prototype.postMessage=function(e){this.connectionEstablished?this.channel.postMessage(e):this.queue.push(e)},e.prototype.set=function(e,t,n){void 0===n&&(n={}),this.local.set(e,t);var o=Object.entries(t).filter(function(e){return"function"==typeof e[1]}).map(function(e){return e[0]});this.postMessage({type:"MP_SET",object:e,methods:o,void:n.void||[]})},e.prototype.get=function(e){return new Promise(function(t,n){var o=this;return this.foreign.has(e)?t(this.foreign.get(e)):t(new Promise(function(t,n){return o.foreign.set(e,t)}))}.bind(this))};return function(t){var n=new e(t);Object.defineProperties(this,{get:{writable:!1,configurable:!1,value:n.get.bind(n)},set:{writable:!1,configurable:!1,value:n.set.bind(n)}})}});
//# sourceMappingURL=index.umd.js.map

119761
docs/static/js/main.js vendored

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

28
index.html Normal file

File diff suppressed because one or more lines are too long

View File

@ -1,186 +0,0 @@
{ ;; Currently, we support either "Markdown" or "Org".
;; This can overwrite your global preference so that
;; maybe your personal preferred format is Org but you'd
;; need to use Markdown for some projects.
;; :preferred-format ""
;; Preferred workflow style.
;; Value is either ":now" for NOW/LATER style,
;; or ":todo" for TODO/DOING style.
:preferred-workflow :todo
;; The app will ignore those directories or files.
;; E.g. "/archived" "/test.md"
:hidden []
;; When creating the new journal page, the app will use your template if there is one.
;; You only need to input your template name here.
:default-templates
{:journals ""}
;; Whether to enable hover on tooltip preview feature
;; Default is true, you can also toggle this via setting page
:ui/enable-tooltip? true
:feature/enable-block-timestamps? false
;; Specify a custom CSS import
;; This option take precedence over your local `logseq/custom.css` file
;; You may find a list of awesome logseq themes here:
;; https://github.com/logseq/awesome-logseq#css-themes
;; Example:
;; :custom-css-url "@import url('https://cdn.jsdelivr.net/gh/dracula/logseq@master/custom.css');"
;; When :all-pages-public? true, export repo would export all pages within that repo.
;; Regardless of whether you've set any page to public or not.
;; Example:
:publishing/all-pages-public? true
;; Specify default home page and sidebar status for Logseq
;; If not specified, Logseq default opens journals page on startup
;; value for `:page` is name of page
;; Possible options for `:sidebar` are
;; 1. `"Contents"` to open up `Contents` in sidebar by default
;; 2. `page name` to open up some page in sidebar
;; 3. Or multiple pages in an array ["Contents" "Page A" "Page B"]
;; If `:sidebar` is not set, sidebar will be hidden
;; Example:
;; 1. Setup page "Changelog" as home page and "Contents" in sidebar
;; :default-home {:page "Changelog", :sidebar "Contents"}
;; 2. Setup page "Jun 3rd, 2021" as home page without sidebar
;; :default-home {:page "Jun 3rd, 2021"}
;; 3. Setup page "home" as home page with multiple pages in sidebar
;; :default-home {:page "home" :sidebar ["page a" "page b"]}
;; Tell logseq to use a specific folder in the repo as a default location for notes
;; if not specified, notes are stored in `pages` directory
;; :pages-directory "your-directory"
;; Tell logseq to use a specific folder in the repo as a default location for journals
;; if not specified, journals are stored in `journals` directory
;; :journals-directory "your-directory"
;; Set this to true will convert
;; `[[Grant Ideas]]` to `[[file:./grant_ideas.org][Grant Ideas]]` for org-mode
;; For more, see https://github.com/logseq/logseq/issues/672
;; :org-mode/insert-file-link? true
;; If you prefer to use the file name as the page title
;; instead of the first heading's title
;; the only option for now is `file`
;; :page-name-order "file"
;; Setup custom shortcuts under `:shortcuts` key
;; Syntax:
;; 1. `+` means keys pressing simultaneously. eg: `ctrl+shift+a`
;; 2. ` ` empty space between keys represents key chords. eg: `t s` means press `s` follow by `t`
;; 3. `mod` means `Ctrl` for Windows/Linux and `Command` for Mac
;; 4. use `false` to disable particular shortcut
;; 4. you can define multiple bindings for one action, eg `["ctrl+j" "down"]`
;; full list of configurable shortcuts are available below:
;; https://github.com/logseq/logseq/blob/master/src/main/frontend/modules/shortcut/config.cljs
;; Example:
;; :shortcuts
;; {:editor/new-block "enter"
;; :editor/new-line "shift+enter"
;; :editor/insert-link "mod+shift+k"
;; :editor/hightlight false
;; :ui/toggle-settings "t s"
;; :editor/up ["ctrl+k" "up"]
;; :editor/down ["ctrl+j" "down"]
;; :editor/left ["ctrl+h" "left"]
;; :editor/right ["ctrl+l" "right"]}
:shortcuts {}
;; By default, pressing `Enter` in the document mode will create a new line.
;; Set this to `true` so that it's the same behaviour as the usual outliner mode.
:shortcut/doc-mode-enter-for-new-block? false
;; Whether to show command doc on hover
:ui/show-command-doc? true
;; Whether to show empty bullets for non-document mode (the default mode)
:ui/show-empty-bullets? false
;; The app will show those queries in today's journal page,
;; the "NOW" query asks the tasks which need to be finished "now",
;; the "NEXT" query asks the future tasks.
:default-queries
{:journals
[{:title "🔨 NOW"
:query [:find (pull ?h [*])
:in $ ?start ?today
:where
[?h :block/marker ?marker]
[(contains? #{"NOW" "DOING"} ?marker)]
[?h :block/page ?p]
[?p :block/journal? true]
[?p :block/journal-day ?d]
[(>= ?d ?start)]
[(<= ?d ?today)]]
:inputs [:14d :today]
:result-transform (fn [result]
(sort-by (fn [h]
(get h :block/priority "Z")) result))
:collapsed? false}
{:title "📅 NEXT"
:query [:find (pull ?h [*])
:in $ ?start ?next
:where
[?h :block/marker ?marker]
[(contains? #{"NOW" "LATER" "TODO"} ?marker)]
[?h :block/ref-pages ?p]
[?p :block/journal? true]
[?p :block/journal-day ?d]
[(> ?d ?start)]
[(< ?d ?next)]]
:inputs [:today :7d-after]
:collapsed? false}]}
;; Add your own commands to speedup.
;; E.g. [["js" "Javascript"]]
:commands
[]
;; Macros replace texts and will make you more productive.
;; For example:
;; Add this to the macros below:
;; {"poem" "Rose is $1, violet's $2. Life's ordered: Org assists you."}
;; input "{{{poem red,blue}}}"
;; becomes
;; Rose is red, violet's blue. Life's ordered: Org assists you.
:macros {}
:markdown/version 2
;; The default level to be opened for the linked references.
;; For example, if we have some example blocks like this:
;; - a [[page]] (level 1)
;; - b (level 2)
;; - c (level 3)
;; - d (level 4)
;;
;; With the default value of level 2, `b` will be collapsed.
;; If we set the level's value to 3, `b` will be opened and `c` will be collapsed.
:ref/default-open-blocks-level 2
:ref/linked-references-collapsed-threshold 50
:ui/show-brackets? false
;; any number between 0 and 1 (the greater it is the faster the changes of the next-interval of card reviews) (default 0.5)
;; :srs/learning-fraction 0.5
;; the initial interval after the first successful review of a card (default 4)
;; :srs/initial-interval 4
;; hide specific properties for blocks
;; E.g. #{:created-at :updated-at}
;; :block-hidden-properties #{}
;; logbook setup
;; :logbook/settings
;; {:with-second-support? false ;limit logbook to minutes, seconds will be eliminated
;; :enabled-in-all-blocks true ;display logbook in all blocks after timetracking
;; :enabled-in-timestamped-blocks false ;don't display logbook at all
;; }
}

View File

@ -1,186 +0,0 @@
{ ;; Currently, we support either "Markdown" or "Org".
;; This can overwrite your global preference so that
;; maybe your personal preferred format is Org but you'd
;; need to use Markdown for some projects.
;; :preferred-format ""
;; Preferred workflow style.
;; Value is either ":now" for NOW/LATER style,
;; or ":todo" for TODO/DOING style.
:preferred-workflow :todo
;; The app will ignore those directories or files.
;; E.g. "/archived" "/test.md"
:hidden []
;; When creating the new journal page, the app will use your template if there is one.
;; You only need to input your template name here.
:default-templates
{:journals ""}
;; Whether to enable hover on tooltip preview feature
;; Default is true, you can also toggle this via setting page
:ui/enable-tooltip? true
:feature/enable-block-timestamps? false
;; Specify a custom CSS import
;; This option take precedence over your local `logseq/custom.css` file
;; You may find a list of awesome logseq themes here:
;; https://github.com/logseq/awesome-logseq#css-themes
;; Example:
;; :custom-css-url "@import url('https://cdn.jsdelivr.net/gh/dracula/logseq@master/custom.css');"
;; When :all-pages-public? true, export repo would export all pages within that repo.
;; Regardless of whether you've set any page to public or not.
;; Example:
:publishing/all-pages-public? true
;; Specify default home page and sidebar status for Logseq
;; If not specified, Logseq default opens journals page on startup
;; value for `:page` is name of page
;; Possible options for `:sidebar` are
;; 1. `"Contents"` to open up `Contents` in sidebar by default
;; 2. `page name` to open up some page in sidebar
;; 3. Or multiple pages in an array ["Contents" "Page A" "Page B"]
;; If `:sidebar` is not set, sidebar will be hidden
;; Example:
;; 1. Setup page "Changelog" as home page and "Contents" in sidebar
;; :default-home {:page "Changelog", :sidebar "Contents"}
;; 2. Setup page "Jun 3rd, 2021" as home page without sidebar
;; :default-home {:page "Jun 3rd, 2021"}
;; 3. Setup page "home" as home page with multiple pages in sidebar
:default-home {:page "Helper Document"}
;; Tell logseq to use a specific folder in the repo as a default location for notes
;; if not specified, notes are stored in `pages` directory
;; :pages-directory "your-directory"
;; Tell logseq to use a specific folder in the repo as a default location for journals
;; if not specified, journals are stored in `journals` directory
;; :journals-directory "your-directory"
;; Set this to true will convert
;; `[[Grant Ideas]]` to `[[file:./grant_ideas.org][Grant Ideas]]` for org-mode
;; For more, see https://github.com/logseq/logseq/issues/672
;; :org-mode/insert-file-link? true
;; If you prefer to use the file name as the page title
;; instead of the first heading's title
;; the only option for now is `file`
;; :page-name-order "file"
;; Setup custom shortcuts under `:shortcuts` key
;; Syntax:
;; 1. `+` means keys pressing simultaneously. eg: `ctrl+shift+a`
;; 2. ` ` empty space between keys represents key chords. eg: `t s` means press `s` follow by `t`
;; 3. `mod` means `Ctrl` for Windows/Linux and `Command` for Mac
;; 4. use `false` to disable particular shortcut
;; 4. you can define multiple bindings for one action, eg `["ctrl+j" "down"]`
;; full list of configurable shortcuts are available below:
;; https://github.com/logseq/logseq/blob/master/src/main/frontend/modules/shortcut/config.cljs
;; Example:
;; :shortcuts
;; {:editor/new-block "enter"
;; :editor/new-line "shift+enter"
;; :editor/insert-link "mod+shift+k"
;; :editor/hightlight false
;; :ui/toggle-settings "t s"
;; :editor/up ["ctrl+k" "up"]
;; :editor/down ["ctrl+j" "down"]
;; :editor/left ["ctrl+h" "left"]
;; :editor/right ["ctrl+l" "right"]}
:shortcuts {}
;; By default, pressing `Enter` in the document mode will create a new line.
;; Set this to `true` so that it's the same behaviour as the usual outliner mode.
:shortcut/doc-mode-enter-for-new-block? false
;; Whether to show command doc on hover
:ui/show-command-doc? true
;; Whether to show empty bullets for non-document mode (the default mode)
:ui/show-empty-bullets? false
;; The app will show those queries in today's journal page,
;; the "NOW" query asks the tasks which need to be finished "now",
;; the "NEXT" query asks the future tasks.
:default-queries
{:journals
[{:title "🔨 NOW"
:query [:find (pull ?h [*])
:in $ ?start ?today
:where
[?h :block/marker ?marker]
[(contains? #{"NOW" "DOING"} ?marker)]
[?h :block/page ?p]
[?p :block/journal? true]
[?p :block/journal-day ?d]
[(>= ?d ?start)]
[(<= ?d ?today)]]
:inputs [:14d :today]
:result-transform (fn [result]
(sort-by (fn [h]
(get h :block/priority "Z")) result))
:collapsed? false}
{:title "📅 NEXT"
:query [:find (pull ?h [*])
:in $ ?start ?next
:where
[?h :block/marker ?marker]
[(contains? #{"NOW" "LATER" "TODO"} ?marker)]
[?h :block/ref-pages ?p]
[?p :block/journal? true]
[?p :block/journal-day ?d]
[(> ?d ?start)]
[(< ?d ?next)]]
:inputs [:today :7d-after]
:collapsed? false}]}
;; Add your own commands to speedup.
;; E.g. [["js" "Javascript"]]
:commands
[]
;; Macros replace texts and will make you more productive.
;; For example:
;; Add this to the macros below:
;; {"poem" "Rose is $1, violet's $2. Life's ordered: Org assists you."}
;; input "{{{poem red,blue}}}"
;; becomes
;; Rose is red, violet's blue. Life's ordered: Org assists you.
:macros {}
:markdown/version 2
;; The default level to be opened for the linked references.
;; For example, if we have some example blocks like this:
;; - a [[page]] (level 1)
;; - b (level 2)
;; - c (level 3)
;; - d (level 4)
;;
;; With the default value of level 2, `b` will be collapsed.
;; If we set the level's value to 3, `b` will be opened and `c` will be collapsed.
:ref/default-open-blocks-level 2
:ref/linked-references-collapsed-threshold 50
:ui/show-brackets? false
;; any number between 0 and 1 (the greater it is the faster the changes of the next-interval of card reviews) (default 0.5)
;; :srs/learning-fraction 0.5
;; the initial interval after the first successful review of a card (default 4)
;; :srs/initial-interval 4
;; hide specific properties for blocks
;; E.g. #{:created-at :updated-at}
;; :block-hidden-properties #{}
;; logbook setup
;; :logbook/settings
;; {:with-second-support? false ;limit logbook to minutes, seconds will be eliminated
;; :enabled-in-all-blocks true ;display logbook in all blocks after timetracking
;; :enabled-in-timestamped-blocks false ;don't display logbook at all
;; }
}

View File

View File

@ -1 +0,0 @@
{}

View File

@ -1,48 +0,0 @@
[{:block/name "a",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "b",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "c",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "card",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "contents",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "doing",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "done",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "favorites",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "in-progress",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "jan 12th, 2022",
:block/created-at 1641945600000,
:block/updated-at 1641945600000}
{:block/name "later",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "now",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "readme",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "todo",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "wait",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}
{:block/name "waiting",
:block/created-at 1645829222203,
:block/updated-at 1645829222203}]

View File

@ -1,10 +0,0 @@
- Jane wakes up
- Jane delegates votes: After reading a proposal in her XXX [[Community]] about implementing a new zero-knowledge solution for votes, she is bewildered by the technical jargon but fascinated by its implications. She navigates to the voting dashboard to see more information, and notices the vote to pass the proposal only has 2 weeks left. She decides this isn't enough time to get the level of understanding she would like to have for voting, so she decides to delegate her voting power to her more technical friend, Mark.
Jane holds a significant amount of voting power within this community as she's been contributing to it for years while Mark is relatively new.
- Jane curates content
- Jane creates content
- Jane joins a new Community
- Jane pays a bill with Community Karma
- Jane checks her [[Agent]]
- Jane creates a Community

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase: Binary Byzantine Agreement (BBA)
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,17 +0,0 @@
Phrase:
Related:
Operating Definition:
- self
- others
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,14 +0,0 @@
Phrase: Crash Fault Tolerant/Tolerance
Operating Definition:
The ability for any "standard" distributed consensus network to be able to have faulty nodes and still operate correctly.
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,22 +0,0 @@
Phrase: Community Interest Community (CIC)
Operating Definition:
A group of people that is trying to come together on a piece of data.
Current Implementation:
On Ethereum, the process of agreement is done by everyone in the entire network. If someone has a decision that needs to come to agreement on, the entire network has to process that data.
The Idea(l):
The ability for groups with various use-cases to be able to find where they can situate themselves either within the main network or as branches in smaller networks.
Logos Implementation:
We are trying to separate the ability for individual groups to come to agreement on their own data together and not be affected by groups outside of themselves unless they've explicitly attached themselves to them.
We will give the ability for a smaller subset of a large number of nodes to come together and specify on validating a smaller group of data they want to come together on and most consensus mechanisms do not allow for that.
(IMPORTANT) Main Differentiator (from Avalanche):
Validators on Avalanche must validate default (primary) subnet in order to participate on validation of other subnets (public or private). We (as Status Network/Logos) want to be able to allow for the disintermediation of overlap that exists between validator nodes so they have the option to operate by overlap or be **completely independent** of Status's (primary) subnet if they so choose to.
Currently, there is NO network that allows for this type of behavior.
Trash Heap:
that are lower-in-value get pushed out of the network because there's a limited amount of space in the network for people to come to agreement upon. Networks overall tend towards higher and higher value.

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase: Confidence
Related:
Operating Definition: How confident am I with each round or iteration of questioning that I am getting or have gotten to the right answer (convergence of iterative process)? Interpretation (economic, reputation (see [Ikingut (Reputation Algorithm)](Ikingut%20(Reputation%20Algorithm).md), et al) of accumulated data in order to reach a certain probabalistic threshold of agreement. Poll network based on your local view of "weight" instead of Avalanche's "staked weight". The amount of staked weight, or weight a given node has, dictates the probability of when it is polled in the network. When you increase stake in the network, you get polled more often for your decisions in the network. In PBFT you need to have complete knowledge of who is participating in each round of consensus.
Current Implementation: Research ongoing.
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,16 +0,0 @@
Phrase:
Related:
Operating Definition: With PBFT mechanisms, once the network decides on something, it is final. There is no forking, very strong confidence once something is committed then it will never change. In Nakamoto Consensus or Logos's the probabalistic consensus mechanism starts from low confidence and probabilistic/confidence grows over time (usually builds exponentially) with no real 'set' finality (can implement a threshold of confidence).
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:
With PBFT mechanisms, once the network decides on something, it is final. There are no forks, very strong confidence once something is committed then

View File

@ -1,14 +0,0 @@
Phrase: Directed Acyclic Graph (DAG)
Operating Definition:
A data structure that allows for branching to occur. A blockchain is just a linear DAG. A DAG is a generalization of that dynamic which can allow for other parts can branch off and continue to exist.
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,18 +0,0 @@
Phrase: Execution Layer Decoupling
Related:
Operating Definition: Concept of a Layer-0 or agreements layer, a network of nodes that come to agreement on arbitrary data and nothing else. From there you can bolt on different execution methods.
When you think of Nakamoto Consensus, the process of coming to agreement (PoW) is tied inexorably to the type of data you are coming into agreement upon. You have to put together that block with all of the transactions and hash that header with nonces so you are tied to the data you are coming into agreement upon which will give you a fundamental bottleneck on how much data you can process at any given time. This is why you have a block time in PoW.
We would like to separate these two things so any two nodes can come into agreement upon any piece of data which gives us a lot of freedom wrt what type of data we are coming into agreement upon and how much data we can process at any given time.
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,14 +0,0 @@
Phrase:
Finality
Operating Definition: The ability for a network to come to agreement on a block of information quickly (hopefully around sub-second to 2 second range). 10 minute block times are out of the question (too slow i.e., Bitcoin).
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,22 +0,0 @@
Phrase: Glacier
Related:
Operating Definition: Better Avalanche consensus lol.
Current Implementation:
1. Querying
2. Computing
1. Confidence
2. Evidence
3. Accumulated Evidence
3. Transition
4. Opinion & Decision (Flip or Settle)
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,272 +0,0 @@
# Understanding the Logos Blockchain Whitepaper
>Title: Understanding the Logos Blockchain Whitepaper | A High-Level Conceptual Overview/Review of the Logos Blockchain
>
>Purpose:
>This document reflects an approach of whitepaper review that combines a rough-draft whitepaper review containing comments/reflections/concerns with a further simplification of concepts to make everything more digestible to more people outside of the internal Status infra team for communication purposes. In addition, this review will provide a gauge of difficulty of understanding involved with various different terms/concepts.
>
Tags: #learning #whitepaper #Logos
---
**"We build everything on top of consensus." **
Dr. Corey Petty
---
**How-To (Get Cookin')**
*There are some descriptions below which detail the usage of visual guidance metrics available in the form of "cookbook-like" instructions for how to consume this document:*
| Gauges | Description | Visualization |
| -------- | :-----------: | :----------: |
|Difficulty| 1-10 (Ticks/Pips) | [&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;] |
|Time | In Minutes | X Minutes |
|Resources | Article/Video Links w/ Visual Content | Conceptual & Pictoral "Ingredients List" of Links|
See below 'Recipe' and modify accordingly to above in Figma.
![](../Pasted%20image%2020220411034611.png)
---
**Operating Definitions:**
*Easiness/Difficulty* is defined as the ease of which the concepts can be generally understood.
*Time/Scope* is in reference to the size of information necessary to learn to gain a decent level of comprehension.
*Resources* is for links relevant to helping people understand the concepts.
---
## Necessary Terminology by Layer
---
### The Six (6) Technology Layers of Logos as a Blockchain
- Terminology Template: [[here]]
#### Consensus
- [[BBA]]
- Difficulty: [&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;]
- Time: 5m
- Resources:
- [[Leaderless]]
- [[DAGs]]
- [[CIC]]
- [[Messaging]]
- [[Permissionless]]
- [[Scalability]]
- [[Decentralization]]
- [[Security]]
- [[Communication Costs]]
- [[Stream or Subgraph]]
- [[Staking]]
- [[Sybil Resistance]]
- [[CFT (Crash Fault Tolerant)]]
- [[BFT (Byzantine Fault Tolerant)]]
- [[Finality]]
- [[Social Applications]]
- [[Bootstrapping]]
- [[Rounds]]
- [[Round-less]]
- [[PBFT]]
- [[DAG-Based Consensus (Avalanche-like)]]
- [[Liveness]]
- [[Asynchronous (P2P)]]
- [[Execution-Layer Decoupling]]
- [[Interchangeability]]
- [[Liveness]]
- [[Extensibility]]
- [[Highly-Partitioned Blockchains with Local Views]]
- [[Ordering]]
- [[Reputation]]
- [[Confidence]]
- [[Network Congestion]]
- [[Topology]]
- [[Resilience (Consensus context)]]
- [[Verifiability]]
- [[Non-Repudiation]]
- [[Snowball]]
- [[Lachesis]]
- [[Glacier]]
#### Node Reputation
- [[Ikingut (Reputation Algorithm)]]
- [[Important Conceptual Goals]]
- Simple
- Lightweight
- Pluggable
- Adaptive
- Dynamic
- Robust
- No Transitive Trust
- Reasonable Bootstrap Time
- [[Reputation Polling]] (Polling Dynamics)
- [[Indirect Request]]
- [[Direct Request]]
- [[Unirep]] (an example)
- [[Qualities Necessary]]
- [[Requires Verifiability]]
- [[Requires Non-Repudiation]]
- [[Privacy Preserving]] (preserve origins of score, emit opinions without a way to trace back the origins - MPC)
- [[ Local Heuristic]]
- [[Algorithm]]
- Each Iteration
1. Voting
2. Agent Action (Post-Consensus Decision Finality)
- Min-Multiplicative Reputation Punishment
- Multiplicative
- Linear
- [[Experimental Research]]
- Starting Point
- Trust Wisdom per Node (requires further elaboration)
- Adversary Types and Effects (requires further elaboration)
- Current Stage of Testing/Challenges
- Silent-Omniscient Adversaries
- Modulating Punishment/No Punishment Impacts to Conditions
- Adding Multiplicative-min Punishment
- Attacks
- Con-Artist Attack
- The On-Off Attack
- Effects on Glacier Consensus
- Limitations
- No immediate defense against coordinated attacks
- Reputation does not add to security
- Future Work
- Circumstantial Impact of Reputation on Consensus
- Long-running Simulation
- Sudden changes in Collective Byzantine Behavior
- Pending Questions
1. Interaction of Stake-based and Reputation-based selection
- Stake simulations are necessary for exploring options
- Relevant in the incentives discussion?
2. How much (and if) does reputation really help in a coordinated attack? (Assuming patient con-artist attack)
- Complex interactions here, this model would particularly benefit having a prototype/PoC
- [[Node Challenges]]
1. [[Intermittence Flexibility | Maintain Operation in High-Churn Network]]
2. [[Sudden Changing Behavior]]
3. [[Bootstrapping Quickly]]
4. [[Resilience to Dynamic Unpredictable Network Changes (Can Handle Membership Volatility)]]
- [[Design]]
1. [[Local reputation view]]
2. [[Adaptive and Dynamic]]
3. [[Required Bootstrapping]]
- [[Network View Not Required]]
- [[Individual Node Reputation Not Required]]
- [[Eigentrust]]
- [[Transitive Trust]]
- [[Understanding the Math]]
- [[Trust Decay]]
- [[Malicious Clusters]] (describe nuances better | trusted nodes cannot overlap the malicious collective)
- [[Trust for Consensus]]
- [[Separation of Reputation]]
- [[Confidant]]
- [[XRep]]
- [[P-Grid]]
- [[R2Trust]]
- [[Generic Taxonomy]]
- [[Dimensions]]
- #Single
- Multiple
- [[Time computation]]
- [[Aggregation]]
- Deterministic sum of positive and negative ratings
- Probabilistic
- [[Logic]]
- Local vs gathered data
- Age of data
- Frequency of data
- Weight of multiple dimensions
- [[Value Control]]
- External
- Internal
- [[Data Aging]]
- None
- Decay
- Death of old/selected
- [[Selection]]
- Ranking-based
- Threshold (trusted/untrusted)
- Probabilistic selection
#### Network Layer and Mempool
- [[Node Discovery]]
- [[Subnetworks]]
- Design
- Implementation
- Ideas
- [[Mempool]]
- Challenges
- Approach
- Mempool Design
#### Staking and Multi-DAG
- [[Factory of DAGs]]
- Concept
- Algorithm
- [[Sub-DAG]]
- [[Cross-DAG]]
- [[Bridge (Intermediary) Nodes]]
- [[Gravity]]
- [[Application-Level User-Driven]]
- [[Direct Communication Channel]]
- [[Direct Communication VGER]]
- [[Challenges]]
- Probabilistic finality and cross-network communication
- Network partitioning, forks and cross-network communication
- Weak Subjectivity - Reputation of nodes matters to clients. Nodes are clients of other networks.
- [[Staking: Verifying Weights]]
- [[Glacier Algorithm Quiesces]]
- [[Approach]]
1. [[Deterministic Finality]]
2. [[Secondary Consensus Protocol]] (form local opinion on external DAG)
3. [[Intermediary DAG]] (Intersection of nodes participating mutually in common structures)
- [[Vertex Sealing]]
- [[XSub]] (Cross-sub-DAG communication)
- [[XDAG]] (Cross-DAG communication)
- [[XDAG Fees]]
- [[Communication Patterns]]
- Direct
- User-Coordinated Channel
- Sub-DAG-Coordinated Channel
- [[Stake Sub-DAG]]
- [[Totally-Ordered Chain]]
- [[Global Knowledge]]
- [[Alternative Designs]]
- [[2P-Set]]
- [[Per-Node Branch]]
#### Data Model and Concurrency
- Reference Work
- [[eUTXO]]
- References (Cardano foundational paper)
- Direct extension of the basic UTXO model
- Validator
- Datum
- Redeemer
- Ledger Description
- [[CKB]]
- Key feature: state space ownership
- Cell description
- Transaction description
- [[Zexe]]
- Key Feature: Privacy
- Transaction Description
- Record Description
- Approach
- [[Data Model Design]]
- Challenges
- Concept
- Data Structures and Constraints
- [[Concurrent Execution (Threads)]]
- [[Execution Patterns]]
- Useful patterns
- Example of EVM execution on this model
- Explore and describe
- Anti-patterns
- High Contention
- Low Affinity
#### Tokenomics
- [[Fees]]
- [[Rewards]]
- [[Slashing]]
- [[MEV]]

View File

@ -1,15 +0,0 @@
Phrase: Highly-Partitioned Blockchains with Local Views
Related:
Operating Definition: Concept that you can have Basically looking at how you can have a network of nodes coming into agreement upon multiple different types of data at the same time (subnets in Avalanche). Then, with any given piece of information, we look at how much you can partition that information within that group (parallelization of information) to try to minimize the amount of work any given node needs to do. Parallelization of work between heavier nodes and lighter nodes can allow both to be relevant within the group.
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,18 +0,0 @@
Phrase: Ikingut
Meaning & History
Means **"friend" in Greenlandic**.
[https://www.imdb.com/title/tt0271003/plotsummary?ref_=tt_ov_pl](https://www.imdb.com/title/tt0271003/plotsummary?ref_=tt_ov_pl)
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,11 +0,0 @@
- This repository is created to help describe the vision and need for the infrastructure supporting [[The Status Network]], which is a collection of technology that is used together to facilitate better human interaction.
- Read [[A day in the life of Jane]] to see a picture of what kind of life this technology potentially enables.
- Read [[The Medium is the Message]] to learn how the technology we influences our relationships.
-
## Thoughts
- Imagine if the focus of your digital assets was around _what_ they did for you instead how much they were worth.
- The value of such a viewpoint puts the utility of a given asset as a priority, and then allows you to reason about that utility's value (or perceived value).
- A portfolio turns into an access panel to different functions within different communities.
- Price becomes a measurement of what someone is willing to pay for that access and functionality.
- [[The Content Marketplace]]
-

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase: Liveness
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,16 +0,0 @@
Phrase:
Round-less
Related: #Rounds, #Messaging, #Scalability
Operating Definition: PBFT variants have this concept of "rounds" which is all-to-all communication. We'd prefer to have "round-less" communication where nodes do not have to talk to all other nodes on a given network for scalability reasons (see [[Scalability]]).
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,18 +0,0 @@
Phrase: Scalability
Related:
Operating Definition:
With PBFT or Paxos-like consensus-like algorithms as you scale the number of validators the messages that need to be passed scales exponentially and that limits the number of validators close to around 100 or so because that message complexity gets too high. Bandwidth too high which affects how fast you can come to finality. As you increase the # of validators you increase the amount of work each validator has to do. This doesn't work for us, we want to keep the amount of work per individual as low as possible so we don't make it difficult for people to get access to available resources to be able to participate. We want to give more people the ability to participate within a network.
We want individual communties to be able to start with a low node count and eventually grow into a large node count. This may require the transition from a specific type of consensus mechanism into a different one or a combination of the two. A small network can join us and use our consensus infrastructure to start and grow off.
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Sybil Resistance (also related to Sybil Defense Mechanisms)
Operating Definition:
Need some "weight" to decision-making otherwise it becomes easy for other people to spin up a bunch of identities that can become "threat actors" to your system by swaying your consensus mechanism.
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,3 +0,0 @@
- Hi Universe!
- I have arrived!
- Herp the derp

View File

@ -1,27 +0,0 @@
- This document attempts to outline the players in what I'm calling the Content Marketplace. That is the landscape of content, its consumers, its curators, and all the technology that is used to store/discover/serve this content and value exchange between the players. I'm sure this term has been used, I'm sure that all of the things in here have been said. It's main to put much of what is needed to discuss the [[3-sided Content Marketplace]] later.
-
## The content creator's situation
- The current content market seems to be broken. Let's explore.
- A content creator, if needing to be self sustainable, needs to do a few things
- capture the attention of an audience.
- make revenue from that attention.
- The content creator seems to have a few ways in which they can monetize attention.
- they can leverage the attention by serving advertisements from folks that think their products have a meaningful overlap with the interests of those giving their attention.
- they can gate the access to the content being created
- they can sell the content being created
## The consumer's situation
- The consumer has a limited amount of attention they can spend on things. They must choose from the infinite material out there to consume. It is their goal to maximize the efficiency of this process such that they care about what they spend their time on.
- The internet grows at a pace that is intractible to keep up to date with. The barrier of entry is practically none existent at this point
- The consumer must know where to go to get content, and will use a place based on a few factors:
- availability of content
- ease of navigating to content desired
- ease of consuming desired content
- cost of access
- discovery of new content
## The curator's situation
- and that place will have to use some sort of process to organizating and serving content to them.
- The curator must choose content from the vast amount of current and new material, grade it, and prioritize it.
- a curator is a sifting mechanism of content. The finished product will always be biased by the subjective evaluations of the perspective of the curator.
- A curator experiences success when content consumers appreciate that bias and leverage them for the content consumption and discovery process.
- A curator can leverage algorithmic processes to automatically score material based on a myriad of weighted metrics. The weights and metrics are the bias of the curator, and are amplified in the finalized content the moment the algorithm classifies more content than the curator could do by hand (and the amount of time spent on the algorithm, metrics, and weights)
- In order to be successful, a curator must understand their audience and subsequently what is perceived as "good" and "bad" such that they can maintain engagement.

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1,15 +0,0 @@
Phrase:
Related:
Operating Definition:
Current Implementation:
The Idea(l):
Logos Implementation:
IMPORTANT Differentiators:
Trash Heap:

View File

@ -1 +0,0 @@
-

View File

@ -1 +0,0 @@
-

View File

@ -1,19 +0,0 @@
### Phrase: [Insert name]
### Related: [Relevant Tags to Concept(s)]
### Operating Definition:
[The widely accepted definition of the phrase.]
### Current "Standard" Implementation:
*Systems that are very similar to us or are the "best-in-class" for a given factor and why?*
### The Idea(l):
*The solution that is aligned with the original Ethereum ethos*
### Logos Implementation:
*The current research*
### IMPORTANT Differentiators:
### Trash Heap:

View File

@ -1,3 +0,0 @@
xvfb-run node publish.mjs -p graph/ -t true -o graph/www
exit $?

View File

Before

Width:  |  Height:  |  Size: 2.7 MiB

After

Width:  |  Height:  |  Size: 2.7 MiB

Some files were not shown because too many files have changed in this diff Show More